[Haskell-cafe] Lazy lists simulated by unboxed mutable arrays

Ketil Malde ketil at malde.org
Wed May 28 04:44:25 EDT 2008

Bulat Ziganshin <bulat.ziganshin at gmail.com> writes:

> well, i don't understand difference between your idea and lazybs
> implementation

HT said earlier that:

>> This would still allow the nice tricks for recursive Fibonacci
>> sequence definition.

Which I guess refers to something like:

  fibs = 1 : 1 : zipWith (+) fibs (tail fibs)

I don't think you can do that with LBS, since you'd need to calculate
a whole chunk at a time, and for any chunk size > 1, each chunk
depends on itself.

If I haven't seen further, it is by standing in the footprints of giants

More information about the Haskell-Cafe mailing list