Difference between revisions of "Monoid"
Jump to navigation
Jump to search
RossPaterson (talk | contribs) (egs, introduce refs) |
Rimmington (talk | contribs) m (fixed "Arrows, like Monads, are Monoids" link) |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 5: | Line 5: | ||
* numbers under addition or multiplication |
* numbers under addition or multiplication |
||
* Booleans under conjunction or disjunction |
* Booleans under conjunction or disjunction |
||
| − | * sets under union |
+ | * sets under union or intersection |
* functions from a type to itself, under composition |
* functions from a type to itself, under composition |
||
| + | |||
| + | Note that in most of these cases the operation is also commutative, but it need not be; concatenation and function composition are not commutative. |
||
| + | |||
| + | A Monoid class is defined in [http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Monoid.html Data.Monoid], and used in [http://www.haskell.org/ghc/docs/latest/html/libraries/base/Data-Foldable.html Data.Foldable] and in the Writer monad. |
||
The monoid interface enables a number of algorithms, including parallel algorithms and tree searches, e.g.: |
The monoid interface enables a number of algorithms, including parallel algorithms and tree searches, e.g.: |
||
| − | * The [http://www.haskell.org/ghc/dist/current/docs/libraries/base/Data-Monoid.html Data.Monoid] module |
||
* 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] |
||
* 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] |
||
| Line 15: | Line 18: | ||
Generalizations of monoids feature in [[Category theory]], for example: |
Generalizations of monoids feature in [[Category theory]], for example: |
||
| − | * [http://www. |
+ | * [http://www.researchgate.net/publication/235540658_Arrows_like_Monads_are_Monoids/file/d912f511ccdf2c1016.pdf Arrows, like Monads, are Monoids] (PDF) |
Revision as of 09:41, 18 February 2014
This article is a stub. You can help by expanding it.
A monoid is an algebraic structure with an associative binary operation that has an identity element. Examples include:
- lists under concatenation
- numbers under addition or multiplication
- Booleans under conjunction or disjunction
- sets under union or intersection
- functions from a type to itself, under composition
Note that in most of these cases the operation is also commutative, but it need not be; concatenation and function composition are not commutative.
A Monoid class is defined in Data.Monoid, and used in Data.Foldable and in the Writer monad.
The monoid interface enables a number of algorithms, including parallel algorithms and tree searches, e.g.:
- An introduction: Haskell Monoids and their Uses
- The blog article Monoids and Finger Trees
- Monad.Reader issue 11, "How to Refold a Map." (PDF), and a follow up
Generalizations of monoids feature in Category theory, for example: