Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Documentation
class Semigroup a => Monoid a where Source #
When providing a new instance, you should ensure it satisfies the two laws: * Right absorption: zero + x ≡ x * Left absorption: x + zero ≡ x
Instances
Monoid Boolean Source # | |
Defined in Pandora.Pattern.Object.Setoid | |
Monoid (Endo a) Source # | |
Defined in Pandora.Paradigm.Basis.Endo | |
Monoid a => Monoid (Identity a) Source # | |
Defined in Pandora.Paradigm.Basis.Identity | |
Semigroup a => Monoid (Maybe a) Source # | |
Defined in Pandora.Paradigm.Basis.Maybe | |
Monoid (Stack a) Source # | |
Defined in Pandora.Paradigm.Structure.Stack | |
(Monoid a, Monoid b) => Monoid (Product a b) Source # | |
Defined in Pandora.Paradigm.Basis.Product | |
(Monoid a, forall b. Semigroup b => Monoid (t b)) => Monoid (Twister t a) Source # | |
Defined in Pandora.Paradigm.Basis.Twister | |
Monoid a => Monoid (Tagged tag a) Source # | |
Defined in Pandora.Paradigm.Basis.Tagged | |
Monoid a => Monoid (Constant a b) Source # | |
Defined in Pandora.Paradigm.Basis.Constant |