[Haskell-cafe] Formalisation for types of monads
yves.pares at gmail.com
Mon May 21 15:25:40 CEST 2012
When explaining monads to beginners (having an imperative background), I
found myself to say that there is *roughly* three "groups" of monads
(because they're always worried about their cost, i.e. their incidental
- Function-oriented monads (e.g. State, Reader, Cont)
- Reductible data-oriented monads (e.g. Maybe, Identity, Writer)
- Irreductible data-oriented monads (e.g. List, free monads) (which, as I
understood, have a (>>=) operation that has a quadratic complexity if not
Are there others "groups" I'm missing and is there terms to formalize them?
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe