Data.Fold.M

Unlike L and R this Comonad is based on a (->) r Comonad for a Monoid r rather than than on the Store r Comonad.

Documentation

data M a b

A foldMap caught in amber. a.k.a. a monoidal reducer

Constructors

forall m . M (m -> b) (a -> m) (m -> m -> m) m

Instances

Corepresentable M

Profunctor M

Choice M

Closed M

Costrong M

Folding M

efficient prefix, efficient postfix

Scan M

AsRM M

We can convert from a monoidal fold to a lazy right fold

AsRM1 M

Cosieve M FreeMonoid

Monad (M a)

Functor (M a)

MonadFix (M a)

Applicative (M a)

Distributive (M a)

Representable (M a)

MonadZip (M a)

Comonad (M a)

ComonadApply (M a)

Apply (M a)

Bind (M a)

Extend (M a)

MonadReader (FreeMonoid a) (M a)

type Corep M = FreeMonoid

type Rep (M a) = FreeMonoid a