Iteration 2-theories

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

Volumn 1349, Issue , 1997, Pages 30-44

  Bloom, Stephen L ^a   Ésik, Zoltán ^b   Labella, Anna ^c   Manes, Ernest G ^d  

^a Stevens Institute of Technology   (United States)

^b UNIVERSITY OF SZEGED   (Hungary)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SOFTWARE ENGINEERING;

2-THEORIES;

ITERATIVE METHODS;

EID: 0342808399     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000461     Document Type: Conference Paper

References (22)

1. A. Aho and J. Ullman. The theory of parsing, translation, and compiling. Vol. I: Parsing. Prentice- Hall Series in Automatic Computation. Prentice-Hall, Inc., Engiewood Cliffs, N. J., 1972.
2. 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.
3. S.L. Bloom, C.C. Elgot and J.B. Wright. Vector iteration in pointed iterative theories. SIAM J. Computing, 9(1980), 525-540.
4. S.L. Bloom and Z. Ésik. Iteration Theories: The Equational Logic of Iterotive Processes. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.
5. F. Borceux. Handbook of Categorical Algebra 1, Basic Category Theory. Encyclopedia of Mathematics and its Applications, Vol. 50, Cambridge University Press, 1994.
6. C.C. Elgot, S.L. Bloom and R. Tindell. On the algebraic structure of rooted trees. Journal of Computer and System Sciences, 16(1978), 362-399.
7. Z. >sik. Identities in iterative and rational algebraic theories. Computational Linguistics and Computer Languages, 14 (1960), 183-207.
8. Z. >sik. The independence of the equational axioms of iteration theories. Journal o] Computer and System Sciences, 36(1988), 66-76.
9. Z. É;sik. Completeness of Park induction. Theoretical Computer Science, 177 (1997) 217-283.
10. Z. Ésik. Group axioms for iteration. To appear.
11. Ésik and A. Labella. Equational properties of iteration in algebraically complete categories. in: proc. conf. Mathematical Foundations of Computer Science '96, LNCS 1113, Springer-Verlag, 1996, 336-347.
12. F. Gécseg and M. Steinby. Tree Automata. Akadémial Kiadó, Budapest, 19s84.
13. P.F. Hoogendijk. Mathematics of Program Construction. 2nd International Conference, June/July 1992. LNCS 669, pages 163-190. Springer Verlag, 1993.
14. P. Freyd. Algebraically complete categories, in: Proc. of Category Theory, Como 1990, LNM vol. 1488, Springer-Verlag, 1991, 95-104.
15. 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.
16. S. Ginall. Regular trees and the free iterative theory. Journal of Computer and System Sciences, 18(1979), 228-242.
17. G.M. Kelly and R. Street. Review of the elements of 2-categories. in: LNM 420, Springer-Verlag, 1974, 76-103.
18. J. Lambek. A fixed point theorem for complete categories. Mathematische Zeitschrifl, 103(1968), 151-161.
19. G. Lallement. Semigroups and Combinatorial Applications. Wiley-Interscience, 1979.
20. F.L. Lawvere. Functorial semantics of algebraic theories. Proceedings of the National Academy o] Sciences USA, 50(1963), 869-873.
21. D. Park. Concurrency and automata on infinite sequences, in: proc. conf. Gesellschafl für Informatik, LNCS 104, Springer-Verlag, 1981, 167-183.
22. J.B. Wright, J. Thatcher, J. Goguen, and E.G. Wagner. Rational algebraic theories and fixedpoint solutions. In Proc. 17th IEEE Symposium on Foundations of Computing, 1976, 147-158.