This link: http://mikael.jansson.be/hacking/misc/export/83/tutors_and_papers/haskell/db-utwente-0000003696.pdf is a complicated, boring but comprehensive explanation of monadic terminology used in programming.

"Comprehending “Comprehending Monads”' by Frederik Eaton: http://ofb.net/~frederik/comp2.pdf is a 3-page nice glossary of terms and notions.

In Haskell, u is called return, and m is called combinator, or 'join'.

Haskell books mention List as an example of a monad, and have a rather special interpretation of State Machine Monad.

Another example of a monad is Google's map/reduce.