|
|
|
|
|
|
by hope-striker
2308 days ago
|
|
|
> The bigger problem is laziness. How is laziness implemented? A value is represented as an unevaluated thunk, a closure to compute the value. When the value is needed, the closure is run and then replaced by the resulting data. This is mutability. And this is something that almost every Haskell program relies on. Tangent: does GHC ever decide that it's cheaper to just potentially evaluate something twice than to use thunks? |
|
|