Elgot algebras

Logical Methods in Computer Science

Volumn 2, Issue 5, 2006, Pages

  Dámek, Jiřía ^a   Milius, Stefan ^a   Velebil, Jiří ^b  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Coalgebra; Elgot algebra; Iterative theories; Rational monad

Indexed keywords

SEMANTICS; SPECIFICATIONS;

ADDITIONAL STRUCTURES; COALGEBRAS; COMPOSITIONALITY; DENOTATIONAL SEMANTICS; FREE ITERATIVE THEORY; ITERATIVE THEORY; RATIONAL MONAD; RECURSIVE EQUATIONS;

ALGEBRA;

EID: 33845680491     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(5:4)2006     Document Type: Article

References (26)

1. P. Aczel, J. Adámek, S. Milius and J. Velebil, Infinite Trees and Completely Iterative Theories: A Coalgebraic View, Theoret. Comput. Sci. 300 (2003), 1-45.
2. J. Adámek, S. Milius and J. Velebil, Free iterative theories: a coalgebraic view, Math. Structures Comput. Sci. 13 (2003), 259-320.
3. J. Adámek, S. Milius and J. Velebil, From Iterative Algebras to Iterative Theories, Electron. Notes Theor. Comput. Sci. 106 (2004), 3-24, full version accepted for publication in Math. Structures Comput. Sci. and available from http://www.stefan-milius.eu.
4. J. Adámek, S. Milius and J. Velebil, Elgot Algebras (Extended Abstract), Electron. Notes Theor. Comput. Sci. 155 (2006), 87-109.
5. J. Adámek and J. Rosický, Locally presentable and accessible categories, Cambridge University Press, 1994.
6. P. America and J. Rutten, Solving Reflexive Domain Equations in a Category of Complete Metric Spaces, in: Proc. 3rd Workshop on the Mathematical Foundations of Programming Language Semantics, M. Main, A. Melton, M. Mislove and D. Schmidt, eds., Springer-Verlag, LNCS 298, 254-288.
7. S. L. Bloom and Z. Ésik, Iteration Theories: The Equational Logic of Iterative Processes, EATCS Monograph Series on Theoretical Computer Science, Springer-Verlag, 1993.
8. B. Courcelle, Fundamental properties of infinite trees, Theoret. Comput. Sci. 25 (1983), no. 2, 95-169.
9. S. Eilenberg, The category C. Unpublished manuscript.
10. C. C. Elgot, Monadic Computation and Iterative Algebraic Theories, in: Logic Colloquium ’73 (eds: H. E. Rose and J. C. Shepherdson), North-Holland Publishers, Amsterdam, 1975.
11. C. C. Elgot, S. L. Bloom and R. Tindell, On the Algebraic Structure of Rooted Trees, J. Comput. System Sci. 16 (1978), 361-399.
12. Z. Ésik, Algebras of iteration theories, J. Comput. System Sci. 27 (1983), 291-303.
13. S. Ginali, Regular trees and the free iterative theory, J. Comput. System Sci. 18 (1979), 228-242.
14. J. Goguen, J. Thatcher, E. Wagner and J. Wright, Initial algebra semantics and continous algebras, J. ACM 24 (1977), 68-95.
15. E. Haghverdi, A Categorical Approach to Linear Logic, Geometry of Proofs and Full Completeness, PhD thesis, University of Ottawa, 2000.
16. M. Hasegawa, Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi, Proc. 3rd International Conference on Typed Lambda Calculi and Applications, Springer LNCS 1210, 196-213, 1997.
17. A. Joyal, R. Street and D. Verity, Traced Monoidal Categories, Math. Proc. Cambridge Philos. Soc. 119 (3), 447-468.
18. S. MacLane, Categories for the Working Mathematician, Springer-Verlag, 2nd edition, 1998.
19. S. Milius, Completely Iterative Algebras and Completely Iterative Monads, Inform. and Comput. 196 (2005), 1-41.
20. S. Milius and L. Moss, The Category Theoretic Solution of Recursive Program Schemes, extended abstract, in Proceedings of the 1st International Conference on Algebra and Coalgebra in Computer Science (CALCO 2005), Lecture Notes in Comput. Sci. 3629, 293-312, full version accepted for publication in Theoret. Comput. Sci. and available from http://www.stefan-milius.eu.
21. L. S. Moss, Recursion and corecursion have the same equational logic, Theoret. Comput. Sci. 294 (2003), 233-267.
22. E. Nelson, Iterative Algebras, Theoret. Comput. Science 25 (1983), 67-94.
23. G. Plotkin, Domains, The “Pisa” notes, available from http://www.dcs.ed.ac.uk/home/gdp/, 1983.
24. A. Simpson and G. Plotkin, Complete Axioms for Categorical Fixed-point Operators, Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science 2000, 30-41.
25. M. B. Smyth and G. Plotkin, The Category-Theoretic Solution of Recursive Domain Equations, SIAM J. Comp. 11 (4), 1982, 761-783.
26. J. Tiuryn, Unique Fixed Points vs. Least Fixed Points, Theoret. Comput. Sci. 12 (1980), 229-254.