[Haskell-cafe] Re: inversion lists

Ted Zlatanov tzz at lifelogs.com
Wed Dec 2 09:55:22 EST 2009

On Wed, 2 Dec 2009 01:12:23 +0100 Daniel Fischer <daniel.is.fischer at web.de> wrote: 

DF> No, quite the opposite. foldr is wonderful for lazy list processing.
DF> I just need to make my function a wee bit lazier:
DF> No, foldl cannot produce anything before the whole list has been traversed, so it can't 
DF> deal with infinite lists at all.

Got it.  I simply had reversed the two functions mentally and thought
foldl was the lazy one.  I'll follow up on the rest separately.


More information about the Haskell-Cafe mailing list