
Data.Monoid  Portability  nonportable (requires extended type classes)  Stability  experimental  Maintainer  libraries@haskell.org 





Description 
Declaration of the Monoid class, and instances for list and functions.
Inspired by the paper
Functional Programming with Overloading and
HigherOrder Polymorphism,
Mark P Jones (http://www.cse.ogi.edu/~mpj/)
Advanced School of Functional Programming, 1995. 

Synopsis 



Documentation 

class Monoid a where 
The monoid class.
A minimal complete definition must supply mempty and mappend,
and these should satisfy the monoid laws.   Methods  mempty :: a  Identity of mappend   mappend :: a > a > a  An associative operation   mconcat :: [a] > a  Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types. 
  Instances  


Produced by Haddock version 0.6 