Monoid
Revision as of 11:13, 25 January 2009 by Henk-Jan van Tuyl (talk | contribs) (Added a link to "How to Refold a Map.")
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
- An introduction: Haskell Monoids and their Uses
- The Data.Monoid module
- The blog article Monoids and Finger Trees
- Monad.Reader issue 11, "How to Refold a Map." (PDF), and a follow up
- Category theory
- Arrows, like Monads, are Monoids (PDF)