[Haskell-beginners] Haskell code optimisation

[Kim-Ee Yeoh]

On Sat, Dec 12, 2015 at 4:19 PM, Abhishek Kumar <abhishekkmr18 at gmail.com>
wrote:

> Thanks Kim for your answer but as far as I understand strict evaluation
> should save in space as expression is not expanded in terms of thunks,but I
> can't understand time savings.Can you pls explain strict evaluation?


For this particular problem, start here:

https://en.wikipedia.org/wiki/Memory_hierarchy

What happens to original program that has a sprawling mass of thunks all
over RAM? The CPU spends most of its time waiting on the memory bus. And
that's not even going into things like disk-backed virtual mem.

-- Kim-Ee
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/beginners/attachments/20151212/c2ea12e0/attachment.html>