| Name | Understanding Monads |
|---|---|
| Depends on | Basic Haskell |
| Authors | Heinrich Apfelmus |
| License | BY-SA-2.0 |
Introduction
This is an example paragaph. Haskell features Lazy evaluation, pattern matching, list comprehensions, typeclasses, type polymorphism. It is a purely functional language, which means that in general, functions in Haskell do not have side effects.Note: this is a side note. Apparently it gets moved out of the text.Another note. There is a distinct type for representing side effects, orthogonal to the type of functions. A pure function may return a side effect which is subsequently executed, modeling the impure functions of other languages.
Haskell features Lazy evaluation, pattern matching, list comprehensions, typeclasses, type polymorphism. It is a purely functional language, which means that in general, functions in Haskell do not have side effects. There is a distinct type for representing side effects, orthogonal to the type of functions. Display hidden note. A pure function may return a side effect which is subsequently executed, modeling the impure functions of other languages.
A monad for every occasion
Clearly, it would be wrong to not conclude that monads are awesome.A very long note that will likely flow into the next section heading.