Data.Monoid.Linear.Internal.Monoid

This module provides linear versions of Monoid.

To learn about how these classic monoids work, go to this school of haskell post.

Monoid operations

class (Semigroup a, Monoid a) => Monoid a where

A linear monoid is a linear semigroup with an identity on the binary operation.

Minimal complete definition

Nothing

Methods

mempty :: a

Instances

Monoid Ordering

Defined in Data.Monoid.Linear.Internal.Monoid

Methods

mempty :: Ordering

Monoid a => Monoid (Dual a)

Defined in Data.Monoid.Linear.Internal.Monoid

Methods

mempty :: Dual a

Monoid (Endo a)

Defined in Data.Monoid.Linear.Internal.Monoid

Methods

mempty :: Endo a

(Movable a, Monoid a) => Monoid (MovableMonoid a)

Defined in Data.Unrestricted.Internal.Instances

Methods

mempty :: MovableMonoid a

MultIdentity a => Monoid (Multiplying a)

Defined in Data.Num.Linear

Methods

mempty :: Multiplying a

AddIdentity a => Monoid (Adding a)

Defined in Data.Num.Linear

Methods

mempty :: Adding a

Monoid (Array a)

Defined in Data.Array.Polarized.Push

Methods

mempty :: Array a

(Monoid a, Monoid b) => Monoid (a, b)

Defined in Data.Monoid.Linear.Internal.Monoid

Methods

mempty :: (a, b)

mconcat :: Monoid a => [a] %1 -> a

Orphan instances

Monoid (Endo a)

Methods

mempty :: Endo a

mappend :: Endo a -> Endo a -> Endo a

mconcat :: [Endo a] -> Endo a