[Haskell-cafe] types and number of evaluation steps

Victor Gorokgov me at rkit.pp.ru
Sat Feb 18 15:23:19 CET 2012

example = a + b + a + b

exampleCSE = x + x
   where x = a + b

With CSE we are introducing new thunk: x.

18.02.2012 17:38, Roman Cheplyaka пишет:
> * Holger Siegel<holgersiegel74 at yahoo.de>  [2012-02-18 12:52:08+0100]
>> You cannot. Common subexpression elimination is done by GHC very
>> conservatively, because it can not only affect impure programs: it can
>> also affects strictness/lazyness and worsen memory usage of pure code.
>> Like the HaskellWiki says: "If you care about CSE, do it by hand."
> How can it affect strictness or laziness?

More information about the Haskell-Cafe mailing list