Indeed. I find laziness and the non-composable nature of space
complexity in Haskell to be a much harder beast to deal with than
immutability.
There is an *excellent* introduction to the basics of lazy
evaluation in Graham Hutton's book Programming in Haskell
(chapter 12), but I don't know of any good references beyond that
basic level. Let us know if you find some!
Dimitri
On 12/4/15 5:35 AM, Joachim Durchholz
wrote:
Am
04.12.2015 um 09:01 schrieb Sumit Sahrawat, Maths & Computing,
IIT (BHU):
If you're comfortable with imperative data
structures, then you can go for
Okasaki's book:
http://www.amazon.com/Purely-Functional-Structures-Chris-Okasaki/dp/0521663504
Which developed from his Ph.D thesis available here:
http://www.cs.cmu.edu/~rwh/theses/okasaki.pdf
People say both are very similar in their contents, but I can't
say for
sure. I've read the first two chapters and found them to be
enlightening.
I read the book, Okasaki is very enlightening but does not talk
about how to deal with partially preevaluated data structures.
Regards,
Jo
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe