Dualising initial algebras

Mathematical Structures in Computer Science

Volumn 13, Issue 2, 2003, Pages 349-370

  Ghani, Neil ^a   LÜth, Christoph ^b   Marchi, Federico De ^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

EID: 0942302114     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003912     Document Type: Article

References (27)

1. Aczel, P., Adamek, J. and Velebil, J. (2001) Iteration monads. In: Montanari, U. (ed.) Proceedings CMCS'01. Electronic Notes in Theoretical Computer Science 44.
2. Adamek, J. (2000) On final coalgebras of continuous functors (to appear).
3. Adamek, J. and Porst, H.-E. (2001) From varieties of algebras to covarieties of coalgebras. In: Montanari, U. (ed.) Proceedings CMCS'01. Electronic Notes in Theoretical Computer Science 44.
4. Adamek, J. and Rosický, J. (1994) Locally Presentable and Accessible Categories, London Mathematical Society Lecture Note Series 189, Cambridge University Press.
5. Awodey, S. and Hughes, J. (2000) The coalgebraic dual of Birkhoffs variety theorem. http://www.contrib.andrew.cmu.edu/user/jesse/papers/CoBirkhoff.ps.gz.
6. Barr, M. (1993) Terminal algebras in well-founded set theory. Theoretical Computer Science 114 299–315.
7. Barr, M. and Wells, C. (1985) Toposes, Triples and Theories, Springer Verlag.
8. Cirstea, C. (2000) An algebra-coalgebra framework for system specification. In: Proceedings CMCS 2000. Electronic Notes in Theoretical Computer Science 33.
9. Dijkstra, E.W. (1976) A Discipline of Programming, Prentice-Hall.
10. Dubuc, E. J. and Kelly, G.M. (1983) A presentation of topoi as algebraic relative to categories or graphs. Journal for Algebra 81 420–433.
11. Fiore, M., Plotkin, G. and Turi, D. (1999) Abstract syntax and variable binding. In: Proc. LICS'99, IEEE Computer Society Press 193–202.
12. Hutton, G. and Gibbons, J. (2001) The generic approximation lemma. Information Processing Letters 79 (4) 197–201.
13. Johnstone, P.T., Power, A. J., Tsuijiushita, T., Watanabe, H. and Worrell, J. (1998) The structure of categories of coalgebras. To appear in Theoretical Computer Science.
14. Kelly, G.M. (1980) A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves and so on. Bull. Austral. Math. Soc. 22 1–83.
15. Kelly, G.M. (1989) Elementary observations on 2-categorical limits. Bull. Austral. Math. Soc. 39 301–317.
16. Kelly, G.M. and Power, A. J. (1993) Adjunctions whose counits are coequalizers, and presentations of finitary monads. Journal for Pure and Applied Algebra 89 163–179.
17. Kurz, A. (2000) Logics for Coalgebra and Applications to Computer Science, Dissertation, Ludwig-Maximilans-Universtität München.
18. Lüth, C. (1996) Compositional term rewriting: An algebraic proof of Toyama's theorem. In: Rewriting Techniques and Applications RTA'96. Springer-Verlag Lecture Notes in Computer Science 1103 261–275.
19. Lüth, C. and Ghani, N. (1997) Monads and modular term rewriting. In: Category Theory in Computer Science CTCS'97. Springer-Verlag Lecture Notes in Computer Science 1290 69–86.
20. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer Verlag.
21. Makkai, M. and Paré, R. (1989) Accessible Categories: The Foundations of Categorical Model Theory. Contemporary Mathematics 104, American Mathematical Society.
22. Moss, L. (1999) Coalgebraic logic. Annals of Pure and Applied Logic 96 277–317.
23. Robinson, E. (1994) Variations on algebra: monadicity and generalisations of equational theories. Technical Report 6/94, Sussex Computer Science Technical Report.
24. Rosu, G. (2000) Equational axiomatisability for coalgebra. Theoretical Computer Science 260 (1).
25. Turi, D. (1996) Functorial Operational Semantics and its Denotational Dual, Ph.D. thesis, Free University, Amsterdam.
26. Winskel, G. (ed.) (1993) The Formal Semantics of Programming Languages, MIT Press.
27. Worrell, J. (1999) Terminal sequences for accessible endofunctors. In: Proceedings CMCS'99. Electronic Notes in Theoretical Computer Science 19.