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

[Bulat Ziganshin]

Hello staafmeister,

Friday, August 28, 2009, 3:31:13 PM, you wrote:

> All the values that are computed but are also GCed (and they will be, 10^9
> bytes 
> is the mem limit). If the GC removes a value then all references in cache to
> those 
> values can also be removed.

it looks like cache of values computed since the last GC, because on
GC all those intermediate results will be collected. i think it's not
very useful outside of fib example that does exact that - reusing
recently computed values


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