References

1. Hukak, Peterson & Fasel (1999): A Gentle Introduction to Haskell 98. Available at http://www.haskell.org/tutorial/. Manuscript.
2. King & Wadler (1992): Combining monads. Proceedings of the 1992 Glasgow Workshop on Functional Programming, pp. 134–143, doi:10.1007/978-1-4471-3215-8_12. Available at http://homepages.inf.ed.ac.uk/wadler/topics/monads.html.
3. Kock (1970): Monads on symmetric monoidal closed categories. Archiv der Mathematik 21(1), pp. 1–10, doi:10.1007/BF01220868.
4. Manes (1976): Algebraic Theories. Graduate Texts in Mathematics 26. Springer Verlag, doi:10.1007/978-1-4612-9860-1.
5. Manes & Mulry (2007): Monad Compositions I: General Constructions and Recursive Distributive laws. Theory and Applications of Categories 18(7), pp. 172–208. Available at www.tac.mta.ca/tac/volumes/18/7/18-07.pdf.
6. Manes & Mulry (2008): Monad Compositions II: Kleisli Strength. Mathematical Structures in Computer Science 18(3), pp. 613–643, doi:10.1017/S0960129508006695.
7. Moggi (1991): Notions of computation and monads. Information and Computation 18(3), pp. 55 –– 92, doi:10.1016/0890-5401.
8. Mulry (1992): Strong monads, algebras and fixed points. London Math Society Lecture Series 177, pp. 202–216, doi:10.1017/CBO9780511525902.012.
9. Mulry (1994): Lifting theorems for Kleisli categories. Springer Lecture Notes in Computer Science 802, pp. 304–319, doi:10.1007/3-540-58027-1_15.
10. Mulry (2013): Interchange laws for monads. To appear.
11. Mulry (2013): Monad transformers and distributive laws. To appear.
12. Scott (1970): Outline of a mathematical theory of computation. Oxford University Computing Laboratory Technical Monograph PRG-2(3).
13. Street (1972): The formal theory of monads. J. Pure Appl. Algebra 2(2), pp. 149 –– 168, doi:10.1016/0022-4049(72)90019-9.
14. Wadler (1992): Comprehending Monads. Mathematical Structures in Computer Science 2(4), pp. 461–493, doi:10.1017/S0960129500001560.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org