Hacker News new | ask | show | jobs
by tome 2006 days ago
Yes, but this doesn't seem to have anything to do with lazy evaluation, rather it is because GHC is quite close to a whole-program optimizer.
1 comments

Optimizing lazy evaluation requires this kind of hole-program optimizations.

Non-strict semantics would be prohibitively slow without these optimizations.

You won't find a Haskell compiler that doesn't do this.