Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
A mechanical proof of the Church-Rosser theorem
Journal of the ACM (JACM)
Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
Parallel reductions in &lgr;-calculus
Information and Computation
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
Journal of Automated Reasoning
Higher-Order Abstract Syntax with Induction in Coq
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Five Axioms of Alpha-Conversion
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantical Analysis of Higher-Order Abstract Syntax
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
A Proof of the Church-Rosser Theorem and its Representation in a Logical Framework
A calculus of transition systems (towards universal coalgebra)
A calculus of transition systems (towards universal coalgebra)
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
ACM SIGACT News
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Automated Reasoning
Mechanized metatheory for the masses: the PoplMark challenge
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Proof pearl: abella formalization of λ-calculus cube property
CPP'12 Proceedings of the Second international conference on Certified Programs and Proofs
Hi-index | 0.00 |
We present the titular proof development that has been verified in Isabelle/HOL. As a first, the proof is conducted exclusively by the primitive proof principles of the standard syntax and of the considered reduction relations: the naive way, so to speak. Curiously, the Barendregt Variable Convention takes on a central technical role in the proof. We also show: (i) that our presentation of the λ-calculus coincides with Curry's and Hindley's when terms are considered equal up to α-equivalence and (ii) that the confluence properties of all considered systems are equivalent.