pandora-0.2.6: A box of patterns and paradigms

Safe HaskellSafe
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
Monoid Boolean Source # 
Instance details

Defined in Pandora.Pattern.Object.Setoid

Methods

zero :: Boolean Source #

Monoid (Endo a) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Endo

Methods

zero :: Endo a Source #

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

Defined in Pandora.Paradigm.Basis.Identity

Methods

zero :: Identity a Source #

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

zero :: Maybe a Source #

Monoid (Stack a) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Stack

Methods

zero :: Stack a Source #

(Monoid a, Monoid b) => Monoid (Product a b) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Product

Methods

zero :: Product a b Source #

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

Defined in Pandora.Paradigm.Basis.Twister

Methods

zero :: Twister t a Source #

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

Defined in Pandora.Paradigm.Basis.Tagged

Methods

zero :: Tagged tag a Source #

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

Defined in Pandora.Paradigm.Basis.Constant

Methods

zero :: Constant a b Source #