Writing programs that construct proofs
Journal of Automated Reasoning
Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
Highlights of the history of the lambda-calculus
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Proof-checking metamathematics (theorem-proving)
Proof-checking metamathematics (theorem-proving)
LISP 1.5 Programmer's Manual
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Mechanically Verifying Concurrent Programs with the Boyer-Moore Prove
IEEE Transactions on Software Engineering
Formal Proofs About Rewriting Using ACL2
Annals of Mathematics and Artificial Intelligence
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
A Mechanization of Unity in PC-NQTHM-92
Journal of Automated Reasoning
Induction Proofs with Partial Functions
Journal of Automated Reasoning
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Formalizing Rewriting in the ACL2 Theorem Prover
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Handbook of automated reasoning
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A PVS Theory for Term Rewriting Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof pearl: de Bruijn terms really do work
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
A Formalization of the Knuth---Bendix(---Huet) Critical Pair Theorem
Journal of Automated Reasoning
The Mechanical Verification of a DPLL-Based Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
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 |
The Church-Rosser theorem is a celebrated metamathematical result on the lambda calculus. We describe a formalization and proof of the Church-Rosser theorem that was carried out with the Boyer-Moore theorem prover. The proof presented in this paper is based on that of Tait and Martin-Löf. The mechanical proof illustrates the effective use of the Boyer-Moore theorem prover in proof checking difficult metamathematical proofs.