Monads and modularity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2309, Issue , 2002, Pages 18-32

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

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

APPLICATION AREA; CO-PRODUCTS; COMBINATION OF DIFFERENT SYSTEMS; DENOTATIONAL SEMANTICS; INDIVIDUAL COMPONENTS; LARGE SYSTEM; LAYER STRUCTURES; TERM REWRITING;

FUNCTIONAL PROGRAMMING;

EID: 84947933772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45988-x_3     Document Type: Conference Paper

References (17)

1. Haskell 98: A non-strict, purely functional language. Available at http://www.haskell.org, January 1999.
2. J. Adamek and J. Rosický. Locally Presentable and Accessible Categories. LMS Lecture Notes 189, Cambridge University Press, 1994.
3. E. J. Dubuc and G. M. Kelly. A presentation of topoi as algebraic relative to categories or graphs. Journal for Algebra, 81:420-433, 1983.
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. N. Ghani, C. Lüth, F. de Marchi, and J. Power. Algebras, coalgebras, monads and comonads. Proc. CMCS’01, ENTCS 44:1, 2001.
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. D. King and P. Wadler. Combining monads. In J. Launchbury and P.M. Samson, editors, Functional Programming, Workshops in Computing, 1993.
9. S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In Proc. of the 22nd ACM Symposium on Principles of Programming Languages. ACM Press, Jan 1995.
10. C. Lüth. Categorical Term Rewriting: Monads and Modularity. PhD thesis, University of Edinburgh, 1998.
11. C. Lüth and N. Ghani. Monads and modular term rewriting. In CTCS’97, LNAI 1290, pages 69-86. Springer, Sep 1997.
12. S. Mac Lane. Categories for the Working Mathematician, Graduate Texts in Mathematics 5. Springer, 1971.
13. E. Moggi. Computational lambda-calculus and monads. In Proc. LICS’89. IEEE, Computer Society Press, June 1989.
14. E. Moggi. An abstract view of programming languages. Technical Report ECSLFCS-90-113, LFCS, 1990.
15. M. Rusinowitch. On the termination of the direct sum of term-rewriting systems. Information Processing Letters, 26(2):65-70, 1987.
16. D. T. Sannella and R. M. Burstall. Structured theories in LCF. In 8th Colloquium on Trees in Algebra and Programming, LNAI 159, pages 377-391. Springer, 1983.
17. D. T. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76(2/3):165-210, Feb/Mar 1988.