[Haskell-cafe] Re: inversion lists

On Wed, 2 Dec 2009 01:12:23 +0100 Daniel Fischer 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. Ted