News for hackers. Stuff that matters.
Re:What is the asymptotic cost of purely functional programm... by eru on Wednesday April 11, 2012 @06:10PM (#3829903)
Yes. And instead of comparing purely functional vs imperative languages, we could sidestep those issues by comparing persistent vs ephemeral data structures, regardless of language.

(For an example of the distinction--straight out of Okasaki's book: the standard purely-functional queue implementation as two linked lists has O(1) amortized runtime in adding and removing only if used `single-threaded' / ephemeral. As a persistent data structure you get a worst case of O(n).)

Re:What is the asymptotic cost of purely functional programm... by bunderbunder on Wednesday April 11, 2012 @06:22PM (#3829948)
Sure. Honestly, that's how I had been interpreting it from the beginning. The SO question seems to be specifically talking about algorithms and not programming languages.