Coalgebraic monads

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 1, 2002, Pages 71-91

  Ghani, Neil ^a   Lüth, Christoph ^b   De Marchi, Federico ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; GRAPH THEORY; RECURSIVE FUNCTIONS; SEMANTICS; SET THEORY;

COALGEBRAIC MONADS; DATATYPES; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMMING;

ALGEBRA;

EID: 18944379669     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80360-8     Document Type: Conference Paper

References (15)

1. P. Aczel, J. Adámek, and J. Velebil. A coalgebraic view of infinite trees and iteration. In Corradini et al., editor, Proceedings of CMCS'01, volume 44(1) of ENTCS. Elsevier, Amsterdam, 2001.
2. J. Adamek, S. Milius, and J. Velebil. Free iterative theories: a coalgebraic view. submitted, 2001.
3. Adamek J., Rosický J. Locally Presentable and Accessible Categories. Number 189 in London Mathematical Society Lecture Note Series. 1994;Cambridge University Press
4. H. P. Barendregt, M. C. J. D. van Ekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep. Term graph rewriting. In Proc. PARLE 87, number 259 in LNCS, pages 141-158. Springer Verlag, 1987.
5. Carboni Aurelio, Lack Steve, Walters R.F.C. Introduction to extensive and distributive categories. Journal of Pure and Applied Algebra. 84:1993;145-158
6. A. Corradini and F. Gadducci. A 2-categorical presentation of term graph rewriting. In Proceedings CTCS'97, volume 1290 of LNCS. Springer, 1997.
7. Courcelle Bruno. Fundamental properties of infinite trees. Theoretical Computer Science. 25:(2):1983;95-169
8. Dubuc E.J., Kelly G.M. A presentation of topoi as algebraic relative to categories or graphs. Journal for Algebra. 81:1983;420-433
9. Elgot C.C., Bloom S.L., Tindell R. On the algebraic structure of rooted trees. Journal of Computing System Sicences. 16:1978;361-399
10. M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. LICS'99, 1999.
11. Neil Ghani, Cristoph Lüth, Federico De Marchi, and John Power. Algebras, coalgebras, monads and comonads. In Corradini et al., editor, Proceedings of CMCS'01, volume 44(1) of ENTCS. Elsevier, Amsterdam, 2001.
12. Masahito Hasegawa. Models of Sharing Graphs: A Categorical Semantics of let and letrec. PhD thesis, University of Edinburgh, 1999.
13. Kelly G.M., Power A.J. Adjunctions whose counits are coequalizers, and presentations of finitary monads. Journal for Pure and Applied Algebra. 89:1993;163-179
14. C. Lüth and N. Ghani. Monads and modular term rewriting. In Category Theory in Computer Science CTCS'97, number 1290 in LNCS, pages 69- 86. Springer, 1997
15. Lawrence Moss. Parametric corecursion. preprint, available at http://math.indiana.edu/home/moss/parametric.ps.