Composing monads using coproducts

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 133-144

  Lüth, Christoph ^a   Ghani, Neil ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

Algorithms; Languages; Theory

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; SEMANTICS;

FUNCTIONAL PROGRAMMING; MONADS;

LOGIC PROGRAMMING;

EID: 0036953934     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/583852.581492     Document Type: Conference Paper

References (23)

1. J. Adamek and J. Rosický. Locally Presentable and Accessible Categories. LMS Lecture Notes 183. Cambridge University Press, 1994.
2. M. Barr and C. Wells. Toposes, Triples and Theories. Grundlehren der mathematischen Wissenschaften 278. Springer Verlag, 1985.
3. R. Bird and O. de Moor. Algebra of Programming. Prentice-Hall, 1997.
4. M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. LICS'99, pages 193-202. IEEE Computer Society Press, 1999.
5. Martin Hyland, Gordon Plotkin, and John Power. Combining computational effects: Commutativity and sum. In TCS 2002, 2nd IFIP International Conference on Computer Science, Montreal, 2002.
6. M. Jones and L. Duponcheel. Composing monads. Technical Report YALEU/DCS/RR-1004, Yale University, Dept. Comp. Sci, Dec 1993.
7. G. M. Kelly. A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves and so on. Bulletins of the Australian Mathematical Society, 22:1-83, 1980.
8. G. M. Kelly. Basic Concepts of Enriched Category Theory, LMS Lecture Notes 64, Cambridge University Press, 1982.
9. G. M. Kelly and A. J. Power. Adjunctions whose counits are coequalizers, and presentations of finitary monads. Journal for Pure and Applied Algebra, 89:163-179, 1993.
10. David King and Philip Wadler. Combining monads. In J. Launchbury and P.M. Samson, editors, Glasgow Workshop on Functional Programming, Workshops in Computing Series, Ayr, July 1992. Springer Verlag.
11. S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. ACM Press, Jan 1995.
12. C. Lüth. Categorical Term Rewriting: Monads and Modularity. PhD thesis, University of Edinburgh, 1998.
13. C. Lüth and N. Ghani. Monads and modular term rewriting. In Category Theory in Computer Science CTCS'97, LNCS 1290. pages 69-86. Springer Verlag, September 1997.
14. C. Lüth and N. Ghani. Monads and modularity. In Frontiers of Combining Systems FroCoS'02, LNAI 2309, pages 18-32. Springer Verlag, 2002.
15. S. Mac Lane Categories for the Working Mathematician, Graduate Texts in Mathematics 5. Springer Verlag, 1971.
16. Ernest G. Manes. Algebraic Theories, Graduate Texts in Mathematics 26. Springer Verlag, 1976.
17. E. Moggi. Computational lambda-calculus and monads. In Fourth Annual Symposium on Logic in Computer Science. IEEE, Computer Society Press, June 1989.
18. E. Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, LFCS, 1990.
19. Gordon Plotkin and John Power. Notions of computation determine monads. In M. Nielsen and U. Engeberg, editors. Proc. FOSSACS 2002, LNCS 2303, pages 342-356, 2002.
20. John Powder. Enriched Lawvere theories. Theories and Applications of Categories 6:83-93, 2000.
21. E. Robinson. Variations on algebra: monadicity and generalisations of equational theories. Technical Report 6/94, Sussex Computer Science, 1994.
22. D. E. Rydeheard and J. G. Stell. Foundations of equational deduction: A categorical treatment of equational proofs and unification algorithms. In Category Theory and Computer Science, LNCS 283, pages 114-139. Springer Verlag, 1987.
23. M. B. Smyth and G. D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal on Computing, 11(4):763-783, 1982.