Equational properties of iteration in algebraically complete categories

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 336-347

  Ésik, Zoltán ^a   Labella, Anna ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLETENESS THEOREMS; FIXED POINT OPERATION; ITERATION THEORY; SOUND AND COMPLETE;

FORMAL LOGIC;

EID: 84947945247     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_160     Document Type: Conference Paper

References (36)

1. J. Adamek. Pree algebras and automata realizations in the language of category theory. Comm. Math. Unive. Carolinae, 15 (1974), 589-602.
2. J. Adamek and V. Koubek. Least fixed point of a functor. J. of Computer and System Sciences, 19 (1979), 163-178.
3. P. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces. J. of Computer and System Sciences, 35 (1989), 343-375.
4. A. Asperti and G. Longo. Categories, Types, and Structures. Foundations of Computing Series. MIT Press, 1991.
5. J. Adamek and V. Trnkova. Automata and Algebras in Categories. Kluwer Academic Publishers, 1990.
6. M.A. Arbib. Free dynamics and algebraic semantics, in: Mathematical Foundations of Computer Science '76, LNCS 56, 1977, 212-227.
7. R. Backhouse, M. Birjsterveld, R. van Geldrop and J. van der Woude. Categorical fixed point calculus, in: proc. conf. Category Theory and Computer Science '95, LNCS 953, Springer-Verlag, 1995, 159-179.
8. S.L. Bloom, C.C. Elgot and J.B. Wright. Solutions of the iteration equation and extension of the scalar iteration operation. SIAM J. Computing, 9 (1980), 26-45.
9. S.L. Bloom, C.C. Elgot and J.B. Wright. Vector iteration in pointed iterative theories. SIAM J. Computing, 9 (1980), 525-540.
10. S.L. Bloom and Z. Ésik. Equational logic of circular data type specification. Theoretical Computer Science, 63 (1989), 303-331.
11. S.L. Bloom and Z. Ésik. Iteration Theories: The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.
12. S.L. Bloom and Z. Ésik. Some equational laws of initiality in 2CCC’s. Int. J. on Foundations of Computer Science, 6 (1995), 95-118.
13. S.L. Bloom and Z. Ésik. Fixed-point operations on CCC’s. Part 1. Theoretical Computer Science, 155 (1996), 1-38.
14. J.C. Conway. Regular Algebra and Finite Machines. Chapman and Hall, 1971.
15. C.C. Elgot. Monadic computation and iterative algebraic theories. In J. C. Shepherdson, editor, Logic Colloquium 1973, Studies in Logic, volume 80. North Holland, Amsterdam, 1975.
16. Z. Ésik. Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages, 14(1980), 183-207.
17. Z. Ésik. The independence of the equational axioms of iteration theories. J. Computer and System Sciences, 36 (1988), 66-76.
18. Z. Ésik. Completeness of Park induction. Theoretical Computer Science, to appear.
19. Z. Ésik. Group axioms for iteration. To appear.
20. P. Freyd. Algebraically complete categories, in: proc. conf. Category Theory, Como 1990, LNM vol. 1488, Springer-Verlag, 1991, 95-104.
21. P. Freyd. Remarks on algebraically compact categories, in: Applications of Categories in Computer Science, London Math. Society Lecture Notes Series, vol. 77, Cambridge University Press, 1992, 95-106.
22. G.M. Kelly and R. Street. Review of the elements of 2-categories, in: LNM 420, Springer-Verlag, 1974, 76-103.
23. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110 (1994), 366-390.
24. J. Lambek. A fixpoint theorem for complete categories. Mathematische Zeitschrift, 103 (1968), 151-161.
25. S. Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer-Verlag, 1971.
26. G. Lallement. Semigroups and Combinatorial Applications. Wiley-Interscience, 1979.
27. F.L. Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy of Sciences USA, 50 (1963), 869-873.
28. D. Lehmann and M.B. Smyth. Algebraic specification of data types: a synthetic approach. Mathematical Systems Theory, 14 (1981), 97-139.
29. M.E. Majster-Cederbaum and F. Zetzsche. Towards a foundation for semantics in complete metric spaces. Information and Computation, 90 (1991), 217-243.
30. R. Milner. A Calculus for Communicating Systems. LNCS 92, Springer-Verlag, 1980.
31. P.S. Mulry. Categorical fixed point semantics. Theoretical Computer Science, 70 (1990), 85-97.
32. G.D. Plotkin. Domains. Lecture Notes. Department of Computer Science, University of Edinburgh, 1983.
33. A.K. Simpson. A characterisation of the least fixed point operator by dinaturality. Theoretical Computer Science, 118 (1993), 301-314.
34. M.B. Smyth and G.D. Plotkin. The category theoretic solution of recursive domain equations. SIAM J. Computing, 11 (1982), 761-783.
35. M. Wand. Fixed point constructions in order enriched categories. Theoretical Computer Science, 8 (1979), 13-30.
36. J.B. Wright, J. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixed-point solutions. In Proc. 17th IEEE Symposium on Foundations of Computing, 1976, 147-158.