Safe Haskell | Trustworthy |
---|---|
Language | Haskell98 |
Data.Fold.M
Description
Documentation
A foldMap
caught in amber. a.k.a. a monoidal reducer
Constructors
M (m -> b) (a -> m) (m -> m -> m) m |
Instances
Corepresentable M # | |
Profunctor M # | |
Choice M # | |
Closed M # | |
Costrong M # | |
Folding M # | |
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 # | |
type Rep (M a) # | |