\begin{thebibliography}{99}

\bibitem{bwttt}
Michael Barr and Charles Wells. 
Toposes, Triples and Theories.
Springer-Verlag, 1983, or see
\url{http://www.cwru.edu/artsci/math/wells/pub/ttt.html} 

\bibitem{prfs}
Jeremy Dawson.
Isabelle proofs: 
\url{http://users.rsise.anu.edu.au/~jeremy/isabelle/monad/}.

% \bibitem{hinze-monadic}
% Ralf Hinze. Monadic-style backtracking. Technical Report IAI-TR-96-9,
% Institut fur Informatik III, Universitat Bonn, October 1996.

\bibitem{jones-composing}
Mark P. Jones and Luc Duponcheel, Composing Monads,
Research Report YALEU/DCS/RR-1004, Yale University, December 1993

\bibitem{lhj} Sheng Liang, Paul Hudak, and Mark P Jones.
Monad Transformers and Modular Interpreters.
In Symposium on Principles of Programming Languages (POPL'95), 1995, 333--343.

\bibitem{maclane-categories} Saunders MacLane.
Categories for the Working Mathematician.
Graduate Texts in Mathematics, Springer, 1971.

\bibitem{manes} Ernest G~Manes.  Algebraic theories.
Graduate Texts in Mathematics, Springer, 1976.

\bibitem{moggi} Eugenio Moggi.  
Computational lambda-calculus and monads. 
In Proceedings of Logic in Computer Science (LICS'89), 1989.

\bibitem{wadler-essence} Philip Wadler. The Essence of Functional Programming.
In Symposium on Principles of Programming Languages (POPL'92), 1992, 1--14.

\bibitem{wadler-free}
Philip Wadler.  Theorems for free!
In 4'th International Conference on Functional Programming and
Computer Architecture, ACM Press, 1989, 347--359. 


\end{thebibliography}

