Change type of foldl' back and implement 'foldL' instead

[chshersh]

foldl' (/) 1 [2,3] doesn't do what it should according to type.

And changing type of foldl' introduces silent breakage.

Naming is another question. As well as an implementation of this function.

[chshersh]

Several unresolved questions:

1. Naming? foldL or foldLeft or flipfoldl' or something else?
2. Should it be polymorphic over container type class?
3. Should we implement it manually or as foldl' . flip?

[volhovm]

I don't really care about foldlL or whatever you'd like to call it, but since this issue is linked with "revert that change", I must write something. So I do. Please revert. :)

[dniku]

Perhaps foldlF/foldlF' and similarly for foldr would do.

[chshersh]

@Pastafarianist What this F stands for?

[volhovm]

"flipped", but this is counterntuitive. F in the end of the word usually means "Functor". flipFoldl(') is better.

[int-index]

I agree with @volhovm , the F in the end immediately makes me think of functors. But I'd prefer flipfoldl to flipFoldl for aesthetic reasons.

[chshersh]

Okay, I can introduce new function:

flipfoldl :: (Container t, Element t ~ a) => (a -> b -> b) -> b -> t -> b

with strict semantic and implement it manually for every data type.

[int-index]

with strict semantic and implement it manually for every data type.

I'd expect flipfoldl' f = foldl' (flip f) with whatever type signature is inferred.