Free iterative theories: A coalgebraic view

Mathematical Structures in Computer Science

Volumn 13, Issue 2, 2003, Pages 259-320

  AdÁmek, JiŘÍ ^a   Milius, Stefan ^a   Velebil, JiŘÍ ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70350703672     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129502003924     Document Type: Article

References (16)

1. Aczel, P., Adamek, J. and Velebil, J. (2001) A coalgebraic view of infinite trees and iteration. Electronic Notes in Theoretical Computer Science 44 (1).
2. Aczel, P., Adamek, J., Milius, S. and Velebil, J. (2002) Infinite trees and completely iterative theories: A Coalgebraic View. (To appear in Theoretical Computer Science)
3. Adamek, J. (1997) A categorical generalisation of Scott domains. Mathematical Structures in Computer Science 7 419–443.
4. Adamek, J. and Koubek, V. (1995) On the greatest fixed point of a set functor. Theoretical Computer Science 150 57–75.
5. Adamek, J., Milius, S. and Velebil, J. (2002) Some remarks on finitary and iterative monads (submitted).
6. Adamek, J. and Rosicky, J. (1994) Locally Presentable and Accessible Categories, Cambridge University Press.
7. Adamek, J. and Trnkova, V. (1990) Automata and Algebras in Categories, Kluwer Academic Publishers.
8. Elgot, C.C. (1975) Monadic computation and iterative algebraic theories. In: Rose, H. E. and Shepherdson, J. C. (eds.) Logic Colloquium 73, North-Holland 175–230.
9. Elgot, C.C., Bloom, S.L. and Tindell, R. (1978) On the algebraic structure of rooted trees. J. Comp. Syst. Sciences 16 361–399. Gabriel, P. and Ulmer, F. (1971) Lokal prasentierbare Kategorien. Springer-Verlag Lecture Notes in Mathematics.
10. Kelly, M. and Power, J. (1993) Adjunctions whose counits are coequalisers, and presentations of finitary enriched monads. J. Pure Appl. Algebra 89 163–179.
11. Lambek, J. (1968) A fixpoint theorem for complete categories. Math. Z. 103 151–161.
12. Manes, E.G. (1976) Algebraic Theories, Springer-Verlag.
13. Moss, L. (2001) Parametric corecursion. Theoretical Computer Science 260 (12) 139–163.
14. Moss, L. (2000) Recursion and corecursion have the same equational logic. (To appear in Theorectical Computer Science)
15. Simpson, A. and Plotkin, G. (2000) Complete axioms for categorical fixed-point operators. Fifteenth Annual IEEE Symposium on Logic in Computer Science 30–41.
16. Trnkova, V. On descriptive classification of set functors. Comment. Math. Univ. Carolinae 12 143–175.