Personal tools

Monoid

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
 
(Added some links)
Line 6: Line 6:
 
* [http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Monoid.html The Data.Monoid module]
 
* [http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Monoid.html The Data.Monoid module]
 
* The blog article [http://apfelmus.nfshost.com/monoid-fingertree.html Monoids and Finger Trees]
 
* The blog article [http://apfelmus.nfshost.com/monoid-fingertree.html Monoids and Finger Trees]
  +
* [[Category theory]]
  +
* [http://www.cs.ru.nl/~heunen/publications/2006/arrows/arrows.pdf Arrows, like Monads, are Monoids] (PDF)

Revision as of 14:30, 21 January 2009

This article is a stub. You can help by expanding it.

A monoid is an algebraic structure with a single, associative binary operation and an identity element.

See also