[Haskell-cafe] Re: If wishes were horses...

[Henning Thielemann]

On Fri, 12 Mar 2010, Johannes Waldmann wrote:

> Ketil Malde <ketil <at> malde.org> writes:
>
>>> Prelude Data.List> :t foldl
>>> foldl :: (a -> b -> a) -> a -> [b] -> a
>>
>> What should the type look like?
>
> Good question - and in my posting I tried to avoid the impression
> that I have an answer, because I really haven't.

foldl' :: Seq a => (a -> b -> a) -> a -> [b] -> a

?

I don't think that foldl' is really what we want, since we cannot control
the  depth of strictness.