Re[Haskell-cafe] [2]: Re[2]: Reduction Sequence of simple Fibonacci sequence implementation

david48 dav.vire+haskell at
Fri Aug 28 07:17:27 EDT 2009

On Fri, Aug 28, 2009 at 1:03 PM, staafmeister<g.c.stavenga at> wrote:

> The list you give prod is also 10 MB so it not a terribly inefficient
> program.

That list takes memory only if it is forced. If it is passed to a lazy
function, all the list may not be in memory at once.

More information about the Haskell-Cafe mailing list