Personal tools

Monoid

From HaskellWiki

(Difference between revisions)
Jump to: navigation, search
(Added another link)
m
Line 4: Line 4:
   
 
== See also ==
 
== See also ==
* An introduction: [http://sigfpe.blogspot.com/2009/01/haskell-monoids-and-their-uses.html Haskell Monoids and their Uses]:
+
* An introduction: [http://sigfpe.blogspot.com/2009/01/haskell-monoids-and-their-uses.html Haskell Monoids and their Uses]
 
* [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]

Revision as of 14:44, 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