Algebras, coalgebras, monads and comonads

Electronic Notes in Theoretical Computer Science

Volumn 44, Issue 1, 2001, Pages 128-145

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

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF BREMEN   (Germany)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; FUNCTIONS; GRAPH THEORY; MAPPING; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

COALGEBRA; COMONADS; ENDOFUCTOR; MONADS;

BOOLEAN ALGEBRA;

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

References (24)

1. P. Aczel, J. Adamek, and J. Velebil. Iteration monads. In U. Montanari, editor, Proceedings CMCS'01, volume 44, 2001.
2. J. Adamek. On final coalgebras of continuous functors. To appear.
3. J. Adamek and J. Rosický. Locally Presentable and Accessible Categories. Number 189 in London Mathematical Society Lecture Note Series. Cambridge University Press, 1994.
4. S. Awodey and J. Hughes. The coalgebraic dual of birkhoffs variety theorem. http://www.contrib.andrew.cmu.edu/user/jesse/papers/CoBirkhoff.ps.gz, 2000.
5. Barr M. Terminal algebras in well-founded set theory. Theoretical Computer Science. 114:1993;299-315
6. M. Barr and C. Wells. Toposes, Triples and Theories. Number 278 in Grundlehren der mathematischen Wissenschaften. Springer Verlag, 1985.
7. C. Cirstea. An algebra-coalgebra framework for system specification. In Proceedings CMCS 2000, volume 33 of Electronic Notes in Theoretical Computer Science, 2000.
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. M. Fiore, G. Plotkin, and D. Turi. Abstract syntax and variable binding. In Proc. LICS'99, 1999.
10. G. Hutton and J. Gibbons. The generic approximation lemma. Information Processing Letters, 2001. To appear.
11. Johnstone P.T., Power A.J., Tsjujushita T., Watanabe H., Worrell J. The structure of categories of coalgebras. 1998
12. Kelly G.M. A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves and so on. Bulletins of the Australian Mathematical Society. 22:1980;1-83
13. Kelly G.M. Elementary observations on 2-categorical limits. Bulletins of the Australian Mathematical Society. 39:1989;301-317
14. 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
15. A. Kurz. Logics for Coalgebra and Applications to Computer Science. Dissertation, Ludwig-Maximilans-Universtität München, 2000.
16. th International Conference, number 1103 in LNCS, pages 261- 275. Springer Verlag, July 1996.
17. 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 Verlag, September 1997.
18. S. Mac Lane. Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer Verlag, 1971.
19. M. Makkai and R. Paré. Accessible Categories: The Foundations of Categorical Model Theory, volume 104 of Contemporary Mathematics. American Mathematical Society, 1989.
20. Moss L. Coalgebraic logic. Annals of Pure and Applied Logic. 96:1999;277-317
21. E. Robinson. Variations on algebra: monadicity and generalisations of equational theories. Technical Report 6/94, Sussex Computer Science Technical Report, 1994.
22. Rosu G. Equational axiomatisability for coalgebra. Theoretical Computer Science. 260:(1):2000
23. D. Turi. Functorial Operational Semantics and its Denotational Dual. PhD thesis, Free University, Amsterdam, 1996.
24. J. Worrell. Terminal sequences for accessible endofunctors. In Electronic Notes in Theoretical Computer Science, volume 19, 1999. Proceedings CMCS '99.