Safe Haskell | Safe-Inferred |
---|---|
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.Paradigm.Primary.Object.Boolean | |
Monoid Natural Source # | |
Defined in Pandora.Paradigm.Primary.Object.Natural | |
Monoid (Endo a) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Endo | |
Monoid a => Monoid (Identity a) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Identity | |
Semigroup a => Monoid (Maybe a) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Maybe | |
Monoid (Stack a) Source # | |
Defined in Pandora.Paradigm.Structure.Stack | |
(Monoid s, Monoid a) => Monoid (s :*: a) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Product | |
(Monoid a, forall b. Semigroup b => Monoid (t b), Covariant t) => Monoid (Construction t a) Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Construction zero :: Construction t a Source # | |
Monoid a => Monoid (Tagged tag a) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Tagged | |
Monoid a => Monoid (Constant a b) Source # | |
Defined in Pandora.Paradigm.Primary.Functor.Constant |