Safe Haskell | Trustworthy |
---|---|
Language | Haskell98 |
Documentation
A foldMap
caught in amber. a.k.a. a monoidal reducer
M (m -> b) (a -> m) (m -> m -> m) m |
Corepresentable M Source # | |
Profunctor M Source # | |
Choice M Source # | |
Closed M Source # | |
Costrong M Source # | |
Folding M Source # | |
Scan M Source # | |
AsRM M Source # | We can convert from a monoidal fold to a lazy right fold |
AsRM1 M Source # | |
Cosieve M FreeMonoid Source # | |
Monad (M a) Source # | |
Functor (M a) Source # | |
MonadFix (M a) Source # | |
Applicative (M a) Source # | |
Distributive (M a) Source # | |
Representable (M a) Source # | |
MonadZip (M a) Source # | |
Comonad (M a) Source # | |
ComonadApply (M a) Source # | |
Apply (M a) Source # | |
Bind (M a) Source # | |
Extend (M a) Source # | |
MonadReader (FreeMonoid a) (M a) Source # | |
type Corep M Source # | |
type Rep (M a) Source # | |