[Haskell-cafe] Flattening tail recursion?

Derek Elkins ddarius at hotpop.com
Sat Dec 11 11:23:07 EST 2004


> intermediate thunk has already been built. You need a separate "strict
> foldl" function, usually called foldl', which was unaccountably
> omitted from the prelude.

There is one in Data.List.


More information about the Haskell-Cafe mailing list