On 2014-03-05, at 22:51 , Greg Ewing email@example.com wrote:
Also, Haskell has the advantage of knowing that the value won't change
I do not see why that would be relevant to thunks. The result of the thunk may be mutable, so what?
That's not what I mean. The value of the thunk can depend on other things that change. In general you can't get away with evaluating it once and caching the result.