Safe Haskell | Trustworthy |
---|
Documentation
A strict left fold / strict Moore machine
forall r . L' (r -> b) (r -> a -> r) r |
Profunctor L' | |
Choice L' | |
Folding L' | |
Scan L' | |
AsL' L' | We can convert a lazy fold to itself |
AsL1' L' | |
AsRM L' | We can convert from a strict left folding to a right or monoidal fold |
AsRM1 L' | |
Monad (L' a) | |
Functor (L' a) | |
Applicative (L' a) | |
MonadZip (L' a) | |
Comonad (L' a) | |
ComonadApply (L' a) | |
Apply (L' a) | |
Bind (L' a) | |
Extend (L' a) |