Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on How is lazy evaluation in Haskell useful?. Parent comment
I still wonder about the mutable data question though. Can we do better than logarithmic overhead, or is there a problem for which we provably cannot?
There are no comments on this comment yet.
I still wonder about the mutable data question though. Can we do better than logarithmic overhead, or is there a problem for which we provably cannot?