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

2009-08-30 Thread wren ng thornton
Luke Palmer wrote: On Fri, Aug 28, 2009 at 6:04 AM, Bulat Ziganshin wrote: 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 compute

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

2009-08-28 Thread Luke Palmer
On Fri, Aug 28, 2009 at 6:04 AM, Bulat Ziganshin wrote: > 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

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

2009-08-28 Thread 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 v

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

2009-08-28 Thread staafmeister
Bulat Ziganshin-2 wrote: > > Hello staafmeister, > > Friday, August 28, 2009, 3:03:13 PM, you wrote: >>> 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? > >>