News for hackers. Stuff that matters.
Re:How is lazy evaluation in Haskell useful? by surrealize on Sunday November 25, 2012 @02:57PM (#4829078)
One of the things haskell can do with lazy sequences is fuse away intermediate data structures, e.g. take

  map f . map g
and substitute

  map (f . g)
automatically (as a compiler optimization). I don't think that's a safe transformation in general in a non-pure language; not sure about a pure strict language.
Re:How is lazy evaluation in Haskell useful? by ibotty on Monday November 26, 2012 @06:35AM (#4831562)
yes, that's possible in a pure referential transparent language (strict or lazy is not the point).