On a description of terminal coalgebras and iterative theories

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 1-16

  Adámek, Jiří ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Basic equation; Finitary functor; Iterative theory; Terminal coalgebra

Indexed keywords

BINARY SEQUENCES; FUNCTIONS; LINEAR ALGEBRA; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

BASIC EQUATION; FINITARY FUNCTOR; ITERATIVE THEORY; TERMINAL COALGEBRA;

ITERATIVE METHODS;

EID: 2442442750     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80629-7     Document Type: Conference Paper

References (9)

1. Aczel P., Adámek J., Milius S. and Velebil, J.: "Infinite Trees and Completely Iterative Theories"; to appear in Theor. Comps. Science.
2. Adámek J., Milius S. and Velebil J.: "On Rational Monads and Free Iterative Theories"; Electr. Notes Theor. Comp. Science 69 (2002)
3. Adámek J., Trnková V. "Automata and Algebras in Categories" 1990;Academic Publishers, Dordrecht
4. Barr M. "Terminal Coalgebras in Well-founded Set Theory" Theor. Comp. Science. 124:1994;182-192
5. Bloom S.L., Ésik Z. "Iteration Theories: The Equational Logic of Iterative Processes" EATCS Monograph Series on Theoretical Computer Science :1993;Springer-Verlag
6. Elgot C.C. "Monadic Computation and Iterative Algebraic Theories" Rose H.E., Shepherdson J.C. Logic Colloquium '73. 1975;175-230 North-Holland Publishers, Amsterodam
7. Elgot C.C., Bloom S.L., Tindell R. "On the Algebraic Structure of Rooted Trees" J. Comp. Syst. Sciences. 16:1978;361-399
8. Lambek J. "A Fixpoint Theorem for Complete Categories" Math. Z. 103:1968;151-161
9. Moss L. "Parametric Corecursion" Theoretical Computer Science. 260:2001;139-163