In 1979, Klop (1980), answering a question raised by Mann in 1972, showed that the extension of λ-calculus with subjective pairing is not confluent. We refer to Klop (1980) and Barendregt (1981, revised 1984) for a perspective. The term presented by Klop to provide a counterexample is fairly simple, but the proof of non-confluence, although intuitively quite simple, involves some technical properties. Among others, a suitable standardization result on derivations in the extended system is needed in the proof. Klop's proof was revisited by Bunder (1985), who seemingly used less technical apparatus than Klop, starting with the same term as Klop. Although Bunder's proof does not explicitly use a standardization result, his proof proceeds internally with some rearrangements of derivations, so that it is fair to say that some standardization technique is present in Bunder (1985).
[1]
Jean-Jacques Lévy,et al.
Confluence properties of weak and strong calculi of explicit substitutions
,
1996,
JACM.
[2]
Martín Abadi,et al.
Explicit substitutions
,
1989,
POPL '90.
[3]
Thérèse Hardin,et al.
Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL
,
1989,
Theor. Comput. Sci..
[4]
H. Barendregt.
The Lambda Calculus: Its Syntax and Semantics
,
1985
.
[5]
Martin W. Bunder,et al.
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators
,
1985,
Theor. Comput. Sci..
[6]
Jan Willem Klop,et al.
Combinatory reduction systems
,
1980
.