Difference between revisions of "Monoid"
Jump to navigation
Jump to search
m |
(Added a link to "How to Refold a Map.") |
||
| Line 7: | Line 7: | ||
* [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] |
||
| + | * [http://haskell.org/sitewiki/images/6/6a/TMR-Issue11.pdf Monad.Reader issue 11, "How to Refold a Map."] (PDF), and a [http://haskell.org/haskellwiki/The_Monad.Reader/Discuss_Issue11 follow up] |
||
* [[Category theory]] |
* [[Category theory]] |
||
* [http://www.cs.ru.nl/~heunen/publications/2006/arrows/arrows.pdf Arrows, like Monads, are Monoids] (PDF) |
* [http://www.cs.ru.nl/~heunen/publications/2006/arrows/arrows.pdf Arrows, like Monads, are Monoids] (PDF) |
||
Revision as of 11:13, 25 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
- 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)