[Haskell-cafe] How to incrementally update list

[Kim-Ee Yeoh]

On Sat, Dec 1, 2012 at 1:16 AM, Mark Thom <markjordanthom at gmail.com> wrote:

> > Is there a paper or other single resource that will help me thoroughly
understand non-strictness in Haskell?

If performance is utterly vital the best resource is Core, as in, the
ability to read it. The order of evaluation is all laid out there. Don [1]
and Johan [2] have written variously about it.

[1] http://stackoverflow.com/questions/6121146/reading-ghc-core
[2]
http://blog.johantibell.com/2012/02/forcing-values-returned-from-monadic.html


-- Kim-Ee


On Sat, Dec 1, 2012 at 1:16 AM, Mark Thom <markjordanthom at gmail.com> wrote:

>
> 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.
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20121201/8166f045/attachment.htm>