On rational monads and free iterative theories

Electronic Notes in Theoretical Computer Science

Volumn 69, Issue , 2003, Pages 23-46

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

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FINITE ELEMENT METHOD; FUNCTIONS; LINEAR EQUATIONS; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

ENDOFUNCTORS; FINITE SYSTEMS; RATIONAL MONADS; RECURSIVE EQUATIONS;

ITERATIVE METHODS;

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

References (18)

1. P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes 14, Stanford University, 1988
2. P. Aczel, J. Adámek and J. Velebil, A Coalgebraic View of Infinite Trees and Iteration, Electronic Notes in Theoretical Computer Science, 44.1 (2001)
3. P. Aczel, J. Adámek, S. Milius and J. Velebil, Infinite Trees and Completely Iterative Theories: A Coalgebraic View, accepted for publication in Theor. Comp. Sci.
4. Aczel P., Mendler N.P. A Final Coalgebra Theorem. Pitt D.H., Rydeheard D.E., Dybjer P., Pitts A.M., Poigné A. Category Theory and Computer Science. 1989;357-365 Springer-Verlag, LNCS 389
5. J. Adámek, S. Milius and J. Velebil, Free Iterative Theories: A Coalgebraic View, accepted for publication in Math. Str. Comp. Sci.
6. J. Adámek, S. Milius and J. Velebil, Final Coalgebras and A Solution Theorem for Arbitrary Endofunctors, Electronic Notes in Theoretical Computer Science 65.1 (2002)
7. J. Adámek, S. Milius and J. Velebil, Some Remarks on Finitary and Iterative Monads, manuscript
8. Barr M. Terminal Coalgebras in Well-Founded Set Theory. Theor. Comp. Science. 124:1994;182-192
9. J. Barwise and L. Moss, Vicious Circles, CSLI Lecture Notes No. 60, 1996
10. Bloom S.L., Elgot C.C. The Existence and Construction of Free Iterative Theories. J. Comput. System Sci. 12:1976;305-318
11. Bloom S.L., Ésik Z. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monograph Series on Theoretical Computer Science. 1993;Springer-Verlag
12. Elgot C.C. Monadic Computation and Iterative Algebraic Theories. Rose H.E., Shepherdson J.C. Logic Colloquium '73. 1975;North-Holland Publishers, Amsterdam
13. Elgot C.C., Bloom S.L., Tindell R. On the Algebraic Structure of Rooted Trees. J. Comp. Syst. Sciences. 16:1978;361-399
14. Gabriel P., Ulmer F. Lokal präsentierbare Kategorien. Lecture N. Math 221. 1971;Springer-Verlag, Berlin
15. N. Ghani, C. Lüth and F. De Marchi, Coalgebraic Monads, Electronic Notes in Theoretical Computer Science 65.1 (2002)
16. Lambek J. A Fixpoint Theorem for Complete Categories. Math. Zeitschrift. 103:1968;151-161
17. Moss L. Parametric Corecursion. Theor. Comput. Sci. 260:(1-2):2001;139- 163
18. Rutten J.J.M.M. Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249:(1):2000;3-80