Data.Fold.L'

Documentation

data L' a b

A strict left fold / strict Moore machine

Constructors

forall r . L' (r -> b) (r -> a -> r) r

Instances

Corepresentable L'

Profunctor L'

Choice L'

Closed L'

Costrong L'

Folding L'

efficient prefix, leaky postfix

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'

Cosieve L' []

Monad (L' a)

Functor (L' a)

MonadFix (L' a)

Applicative (L' a)

Distributive (L' a)

Representable (L' a)

MonadZip (L' a)

Comonad (L' a)

ComonadApply (L' a)

Apply (L' a)

Bind (L' a)

Extend (L' a)

MonadReader [a] (L' a)

type Corep L' = []

type Rep (L' a) = [a]

unfoldL' :: (s -> (b, a -> s)) -> s -> L' a b

Construct a strict Moore machine from a state valuation and transition function