Relating confluence, innermost-confluence and outermost-confluence properties of term rewriting systems

Acta Informatica

Volumn 33, Issue 6, 1996, Pages 595-606

  Krishna Rao, M R K ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030502222     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050060     Document Type: Article

References (6)

1. N. Dershowitz, J.-P. Jouannaud (1990): Rewrite systems. In: J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, Vol. B, pp. 243-320, North-Holland
2. B. Gramlich (1992): Relating innermost, weak, uniform and modular termination of term rewrite systems. Proc. of Logic Prog. and Automated Reasoning. LPAR'92 (Lecture Notes in Computer Science 624, pp. 285-296) Springer-Verlag. Revised version to appear in a special issue of Fundamenta Informaticae on term rewrite systems
3. J.W. Klop (1992): Term rewriting systems. In: S. Abramsky, D. Gabbay, T. Maibaum (eds.) Handbook of Logic in Computer Science, Vol. 2. Oxford University Press
4. M.J. O'Donnell (1977): Computing in systems described by equations. Lecture Notes in computer Science, Vol. 58. Springer-Verlag
5. D.A. Plaisted (1993): Equational reasoning and term rewriting systems. In: S. Abramsky, D. Gabbay, T. Maibaum (eds.) Handbook of logic in artificial intelligence and logic programming, Vol. 1. Oxford University Press
6. J. Staples (1975): Church-Rosser Theorems for Replacement Systems. In: J. Crosley (ed.) Algebra and Logic. (Lecture Notes in Mathematics, Vol 450, pp. 291-307) Springer-Verlag