Infinite trees and completely iterative theories: A coalgebraic view

Theoretical Computer Science

Volumn 300, Issue 1-3, 2003, Pages 1-45

  Aczel, Peter ^a   Adámek, Jiří ^b   Milius, Stefan ^b   Velebil, Jiří ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Coalgebra; Completely iterative theory; Monad; Monoidal category; Solution Theorem

Indexed keywords

ALGEBRA; ITERATIVE METHODS; THEOREM PROVING; TREES (MATHEMATICS);

INFINITE TREES;

COMPUTER SCIENCE;

EID: 0038753013     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00728-4     Document Type: Article

References (27)

1. P. Aczel, Non-well-founded Sets, CSLI Lecture Notes No. 14, Stanford University, Stanford, CA, 1988.
2. Aczel P., Adámek J., Velebil J. A coalgebraic view of infinite trees and iteration. Electron. Notes Theoret. Comput. Sci. 44(1):2001.
3. Adámek J. Free algebras and automata realizations in the language of categories. Comment. Math. Univ. Carolin. 15:1974;589-602.
4. J. Adámek, Final coalgebras are cauchy completions of initial algebras. Theoret. Comput. Sci., to appear.
5. Adámek J., Koubek V. On the greatest fixed point of a set functor. Theoret. Comput. Sci. 150:1995;57-75.
6. Adámek J., Porst H.-E. From varieties of algebras to covarieties of coalgebras. Electron. Notes Theoret. Comput. Sci. 44(1):2001.
7. Adámek J., Reiterman J. Banach's fixed-point theorem as a base for data-type equations. Appl. Categorical Struct. 2:1994;77-90.
8. Adámek J., Rosický J. Locally Presentable and Accessible Categories. 1994;Cambridge University Press, Cambridge.
9. Adámek J., Trnková V. Automata and Algebras in Categories. 1990;Kluwer Academic Publishers, Dordrecht.
10. America P., Rutten J. Solving reflexive domain equations in a category of complete metric spaces. J. Comput. System Sci. 39:1989;343-375.
11. Barr M. Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 114:1993;299-315.
12. Barwise J., Etchemendy J. The Liar. 1987;Oxford University Press, Oxford.
13. J. Barwise, L. Moss, Vicious Circles, CSLI Lecture Notes No. 60, Stanford University, Stanford, CA, 1996.
14. Bloom S.L., Ésik Z. Iterative Theories: The Equational Logic of Iterative Processes. EATCS Monograph Series on Theoretical Computer Science. 1993;Springer, Berlin.
15. Elgot C.C. Monadic computation and iterative algebraic theories. Rose H.E., Shepherdson J.C. Logic Colloquium '73. 1975;North-Holland Publishers, Amsterdam.
16. Elgot C.C., Bloom S.L., Tindell R. On the algebraic structure of rooted trees. J. Comput. System Sci. 16:1978;361-399.
17. Ghani N., Lüth C., de Marchi F., Power J. Algebras, coalgebras, monads and comonads. Electron. Notes Theoret. Comput. Sci. 44(1):2001.
18. Goguen J.A., Thatcher S.W., Wagner E.G., Wright J.B. Initial algebra semantics and continuous algebras. J. ACM. 24:1977;68-95.
19. Jech T. Set Theory. 1978;Academic Press, New York.
20. Lambek J. A fixpoint theorem for complete categories. Math. Z. 103:1968;151-161.
21. F.E.J. Linton, Some aspects of equational categories, in: Proc. Conf. Categorical Algebra, La Jolla, 1965, Springer, Berlin, 1966, 84-94.
22. Makkai M., Paré R. Accessible Categories: The Foundations of Categorical Model Theory. Contemporary Mathematics. Vol. 104:1989;AMS, Providence, RI.
23. S. Milius, On iteratable endofunctors, Electron. Notes Theoret. Comput. Sci. 69 (2002).
24. Moss L. Parametric corecursion. Theoret. Comput. Sci. 260:2001;139-163.
25. L. Moss, Recursion and corecursion have the same equational logic, preprint, available at http://math.indiana.edu/home/moss/eqcoeq.ps.
26. Smyth M.B., Plotkin G.D. The category-theoretic solution of recursive domain equations. SIAM J. Comput. 11:1982;761-783.
27. Tiuryn J. Unique fixed points vs. least fixed points. Theoret. Comput. Sci. 12:1980;229-254.