pandora-0.3.3: A box of patterns and paradigms
Safe HaskellSafe-Inferred
LanguageHaskell2010

Pandora.Pattern.Object.Monoid

Synopsis

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

Methods

zero :: a Source #

Instances

Instances details
Monoid Boolean Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Object.Boolean

Methods

zero :: Boolean Source #

Monoid Natural Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Object.Natural

Methods

zero :: Natural Source #

Monoid (Endo a) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Endo

Methods

zero :: Endo a Source #

Monoid a => Monoid (Identity a) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Identity

Methods

zero :: Identity a Source #

Semigroup a => Monoid (Maybe a) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

zero :: Maybe a Source #

Monoid (Stack a) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Stack

Methods

zero :: Stack a Source #

(Monoid s, Monoid a) => Monoid (s :*: a) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Product

Methods

zero :: s :*: a Source #

(Monoid a, forall b. Semigroup b => Monoid (t b), Covariant t) => Monoid (Construction t a) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Construction

Methods

zero :: Construction t a Source #

Monoid a => Monoid (Tagged tag a) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Tagged

Methods

zero :: Tagged tag a Source #

Monoid a => Monoid (Constant a b) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Constant

Methods

zero :: Constant a b Source #