Weak Orthogonality Implies Con(cid:2)uence(cid:3) the Higher(cid:4)Order Case

In this paper we prove confluence for weakly orthogonal Higher-Order Rewriting Systems. This generalises all the known ‘confluence by orthogonality’ results.

[1]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[2]  Jean-Louis Lassez,et al.  Computational logic: essays in honor of Alan Robinson , 1991 .

[3]  Jean-Pierre Jouannaud,et al.  More Problems in Rewriting , 1993, RTA.

[4]  Vincent van Oostrom,et al.  Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems , 1993, HOA.

[5]  Jean-Jacques Lévy,et al.  Computations in Orthogonal Rewriting Systems, II , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[6]  Jan Willem Klop,et al.  Combinatory reduction systems , 1980 .

[7]  Cosimo Laneve,et al.  Interaction Systems I: The Theory of Optimal Reductions , 1994, Math. Struct. Comput. Sci..

[8]  Jean-Jacques Lévy,et al.  An abstract standardisation theorem , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[9]  Tobias Nipkow.  Orthogonal Higher-Order Rewrite Systems are Confluent , 1993, TLCA.

[10]  David A. Wolfram,et al.  The Clausal Theory of Types , 1993 .

[11]  V. van Oostrom,et al.  Confluence for Abstract and Higher-Order Rewriting , 1994 .

[12]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[13]  A. Church,et al.  Some properties of conversion , 1936 .

[14]  F. vanRaamsdonk,et al.  Weak orthogonality implies confluence: the higher-order case , 1994 .

[15]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  Tobias Nipkow,et al.  Higher-order critical pairs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[17]  John Lamping.  An algorithm for optimal lambda calculus reduction , 1989, POPL '90.

[18]  Vinod Kathail,et al.  Optimal interpreters for lambda-calculus based functional languages , 1990 .