[Haskell-cafe] How to incrementally update list

Mark Thom markjordanthom at gmail.com
Fri Nov 30 19:16:49 CET 2012

> Haskell's laziness is tricky to understand coming from imperative
> languages, but once you figure out its evaluation rules, you'll begin to
> see the elegance.

Is there a paper or other single resource that will help me thoroughly
understand non-strictness in Haskell? Once my programs hit a certain level
of complexity, their behaviour becomes much harder for me to predict. I've
been using the wiki pages up to this point, but apparently they haven't
pushed my understanding of laziness nearly far enough.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20121130/0a9c91ca/attachment.htm>

More information about the Haskell-Cafe mailing list