Geometric proof of confluence by decreasing diagrams

Journal of Logic and Computation

Volumn 10, Issue 3, 2000, Pages 437-460

  Klop, Jan Willem ^a,b,c   Van Oostrom, Vincent ^a,d   De Vrijer, Roel ^b  

^a CWI   (Netherlands)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^d UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

THEOREM PROVING;

ABSTRACT REWRITING; CONFLUENCE CRITERIA; DECREASING DIAGRAM THEOREM;

COMPUTATIONAL GEOMETRY;

EID: 0033687012     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/10.3.437     Document Type: Article

References (14)

1. L. Bachmair, N. Dershowitz and J. Hsiang. Orderings for equational proofs. In Proceedings of the 1st IEEE Symposium on Logic in Computer Science, pp. 346-357, Cambridge MA, 1986.
2. Marc Bezem, Jan Willem Klop, and Vincent van Oostrom. Diagram techniques for confluence. Information and Computation, 141, 172-204, 1998.
3. M. Bognar. A point version of decreasing diagrams. In Proceedings Accolade'96, J. Engelfriet and T. Spaan, eds., pp. 1-14, Amsterdam, 1997. Dutch Graduate School in Logic.
4. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
5. N. G. de Bruijn. A note on weak diamond properties. Memorandum 78-08, Eindhoven University of Technology, August 1978.
6. J. R. Hindley. The Church-Rosser Property and a Result in Combinatory Logic. PhD thesis, University of Newcastle-upon-Tyne, 1964.
7. G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems. Journal of the ACM, 27, 797-821, 1980.
8. J. W. Klop. Term rewriting systems. In Handbook of Logic in Computer Science, volume 1. D. Gabbay S. Abramski and T. Maibaum, eds., Oxford University Press, 1992.
9. J. W. Klop. Combinatory Reduction Systems. Mathematical Centre Tracts Nr. 127. CWI, Amsterdam, 1980. PhD Thesis.
10. M. H. A. Newman. On theories with a combinatorial definition of 'equivalence'. Annals of Mathematics, 43, 223-243, 1942.
11. V. van Oostrom. Confluence by decreasing diagrams. Theoretical Computer Science, 126, 259-280, 1994.
12. V. van Oostrom. Confluence for Abstract and Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, March 1994.
13. G. D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the "Pisa notes"). Department of Computer Science, University of Edinburgh, 1981.
14. J. Staples. Church-Rosser theorems for replacement systems. In Algebra and Logic, J. Crossley, ed., pp. 291-307. Number 450 in Lecture Notes in Mathematics, Springer-Verlag, 1975.