Bulat Ziganshin <[EMAIL PROTECTED]> 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. -k -- If I haven't seen further, it is by standing in the footprints of giants _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
