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

[Bulat Ziganshin]

Hello staafmeister,

Friday, August 28, 2009, 2:34:07 PM, you wrote:
> Well in case I call (prod list) again it could lookup the reference and see

so it should keep a list of all values ever computed in program,
together with their expressions? :) are you like idea of prod[1..10^6]
computation taking 10 mbytes of memory?



-- 
Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com