pandora-0.1.4: 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: unit <> x ≡ x
* Left absorption: x <> unit ≡ x

Methods

unit :: a Source #

Instances
Monoid (Endo a) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Endo

Methods

unit :: Endo a Source #

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

unit :: Maybe a Source #

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

Defined in Pandora.Paradigm.Basis.Identity

Methods

unit :: Identity a Source #

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

Defined in Pandora.Paradigm.Basis.Product

Methods

unit :: Product a b Source #

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

Defined in Pandora.Paradigm.Basis.Cofree

Methods

unit :: Cofree t a Source #

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

Defined in Pandora.Paradigm.Basis.Constant

Methods

unit :: Constant a b Source #

(forall (u1 :: k2 -> Type). Monoid ((u1 :.: t u1) a)) => Monoid (Y t u a) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Transformer

Methods

unit :: Y t u a Source #

Monoid ((u :.: t) a) => Monoid (T t u a) Source # 
Instance details

Defined in Pandora.Paradigm.Junction.Transformer

Methods

unit :: T t u a Source #