Calculating Church-Rosser proofs in Kleene[ algebra

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

Volumn 2561, Issue , 2002, Pages 276-290

  Struth, Georg ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

Church rosser theorem; Formal mathematics; Kleene algebra; Rewriting; calculus

Indexed keywords

CALCULATIONS; DIFFERENTIATION (CALCULUS); MACHINERY; RELIGIOUS BUILDINGS;

CHURCH-ROSSER THEOREM; EQUATIONAL THEORY; FORMAL MATHEMATICS; KLEENE ALGEBRAS; LAMBDA CALCULUS; QUASIORDERINGS; REWRITING; TRANSITIVE RELATION;

ALGEBRA;

EID: 84947243212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36280-0_19     Document Type: Conference Paper

References (26)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. H. P. Barendregt. The Lambda Calculus. Studies in Logic and the Foundations of Mathematics. North-Holland, revised edition, 1984.
3. S. L. Bloom and Z. Ésik. Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1991.
4. E. Cohen. Separation and reduction. In R. Backhouse and J. N. Oliveira, editors, Proc. of Mathematics of Program Construction, 5th International Conference, MPC 2000, volume 1837 of LNCS, pages 45-59. Springer-Verlag, 2000.
5. J. H. Conway. Regular Algebra and Finite State Machines. Chapman and Hall, 1971.
6. S. Crvenkovič, I. Dolinka, and Z. Ésik. The variety of Kleene algebras with conversion in not finitely based. Theoretical Computer Science, 230: 235-245, 2000.
7. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.
8. H. Doornbos, R. C. Backhouse, and J. van der Woude. A calculation approach to mathematical induction. Theoretical Computer Science, 179: 103-135, 1997.
9. S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974.
10. P. Freyd and A. Scedrov. Categories, Allegories. North-Holland, 1990.
11. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, 2000.
12. J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Comput., 15: 1155-1194, 1986.
13. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2): 366-390, 1994.
14. D. Kozen. Kleene algebra with tests and commutativity conditions. In T. Margaria and B. Steffen, editors, Proc. of TACAS'96, volume 1055 of LNCS, pages 14-33. Springer-Verlag, 1996.
15. D. Kozen and M.-C. Patron. Certification of compiler optimizations using Kleene algebra with tests. In J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palmadessi, L.-M. Pereira, V. Sagiv, and P.-J. Stuckey, editors, 1st International Conference on Computational Logic (CL2000), volume 1861 of LNAI, pages 568-582. Springer-Verlag, 2001.
16. J. Levy and J. Agustí. Bi-rewrite systems. J. Symbolic Comput., 22: 279-314, 1996.
17. J. McKinna and R. Pollack. Some lambda calculus and type theory formalized. J. Automated Reasoning, 23(3-4): 373-409, 99.
18. T. Nipkow. More Church-Rosser proofs (in Isabelle/HOL). J. Automated Reasoning, 26(1): 51-66, 2001.
19. V. N. Redko. On defining relations for the algebra of regular events. Ukrainian Mathematical Journal, 16: 120-126, 1964.
20. G. W. Schmidt and T. Ströhlein. Relations and Graphs: Discrete Mathematics for Computer Scientists. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1993.
21. N. Shankar. A mechanical proof of the Church-Rosser theorem. Journal of the ACM, 35(3): 475-522, 1988.
22. J. M. Spivey. Understanding Z. Cambrigde University Press, 1988.
23. G. Struth. Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis, Institut für Informatik, Universität des Saarlandes, 1998.
24. G. Struth. Church-Rosser proofs in Kleene algebra and allegories. Technical Report 146, Institut für Informatik, Albert-Ludiwigs-Universität Freiburg, 2001. http://www.informatik.uni-freiburg.de/~struth/publications.html.
25. G. Struth. Isabelle-specification and proofs of Church-Rosser theorems. http://www.informatik.uni-freiburg.de/~struth/publications.html, 2001.
26. M. Takahashi. Parellel reductions in λ-calculi. Information and Computation, 118(1): 120-127, 1995.