[Haskell-cafe] Flattening tail recursion?

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.