Re: [Haskell-beginners] tutorials on space complexity?

Thanks Bob. Following your previous comment on this list, I read chapter 2 and really liked it, but I feel it was only scratching the surface. The example bug of implementing 'sum' using 'foldl' was insightful, but I'm sure 'foldl (+)' is not the only circumstance where laziness builds up large data structures unnecessarily and I'm afraid of recursion now. Are there more insights peppered throughout the book? Or other good pointers you know? Thanks again! Dimitri Em 09/06/14 23:21, Bob Ippolito escreveu:

I found the beginning of Parallel and Concurrent Programming in Haskell particularly enlightening: http://chimera.labs.oreilly.com/books/1230000000929/ch02.html#sec_par-eval-w...

After reading that, Haskell's evaluation strategy finally clicked for me. Now I can much more easily spot and fix these sorts of errors before even running them for the most part.

On Mon, Jun 9, 2014 at 10:01 PM, Dimitri DeFigueiredo mailto:defigueiredo@ucdavis.edu> wrote:

Are there any good tutorials on understanding space complexity for haskell programs?

My current approach of "waiting for it to crash" by being out of memory, doesn't really seem like good engineering practice. However, I have not found a source that gives me any proactive insight into what should be avoided. Most of what I have read only helps to solve the problem "after the fact". How do we design programs that avoid those problems from the beginning? Any pointers?

Thanks,

Dimitri _______________________________________________ Beginners mailing list Beginners@haskell.org mailto:Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners

_______________________________________________ Beginners mailing list Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners