Church-Rosser theorems for abstract reduction modulo an equivalence relation

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

Volumn 1379, Issue , 1998, Pages 17-31

  Ohlebusch, Enno ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY;

ABSTRACT REDUCTION; CHURCH-ROSSER PROPERTY; CHURCH-ROSSER THEOREM; EQUIVALENCE RELATIONS; NEW RESULTS; REWRITING MODULO; REWRITING SYSTEMS; TWO WAYS;

RELIGIOUS BUILDINGS;

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

References (14)

1. J. Avenhaus. Reduktionssysteme. Springer Verlag, 1995 (in German)
2. A. Geser. Relative Termination. PhD thesis, Universität Passau, 1990.
3. R. Hindley. The Church-Rosser Property and a Result in Combinatory Logic. PhD thesis, University of Newcastle-upon-Tyne, 1964.
4. G. Huet. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. J. of the ACM 27(4), pages 797-821, 1980.
5. J-P. Jouannaud and H. Kirchner. Completion of a Set of Rules Modulo a Set of Equations. SIAM J. on Computing 15(4), pages 1155-1194, 1986.
6. J.-P. Jouannaud and M. Munoz. Termination of a Set of Rules Modulo a Set of Equations. In Proceedings of the 7th International Conference on Automated Deduction, pages 175-193. LNCS 170, 1984.
7. J.W. Klop. Term Rewriting Systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1-116. Oxford University Press, 1992.
8. E. Ohlebusch. Conditional Graph Rewriting. In Proceedings of the 6th International Conference on Algebraic and Logic Programming, pages 144-158. LNCS 1298, 1997.
9. V. van Oostrom. Confluence by Decreasing Diagrams. Theoretical Computer Science 126(2), pages 259-280, 1994.
10. V. van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit te Amsterdam, 1994.
11. R. Pino Pérez and Ch. Even. An Abstract Property of Confluence Applied to the Study of the Lazy Partial Lambda Calculus. In Proceedings of the 3rd International Symposium on Logical Foundations of Computer Science, pages 278-290. LNCS 813, 1994.
12. B.K. Rosen. Tree-Manipulating Systems and Church-Rosser Theorems. J. of the ACM 20(1), pages 160-187, 1973.
13. R. Sethi. Testing for the Church-Rosser Property. J. of the ACM 21, pages 671-679, 1974.
14. J. Staples. Church-Rosser Theorems for Replacement Systems. In J. Crosley, editor, Algebra and Logic, pages 291-307. Lecture Notes in Mathematics 450, 1975.