TY - JOUR
T1 - More Church-Rosser proofs
AU - Nipkow, Tobias
N1 - Funding Information:
Research supported by DFG Schwerpunktprogramm Deduktion, Br 887/4-3.
PY - 2001
Y1 - 2001
N2 - The proofs of the Church-Rosser theorems for β, η, and βqqη reduction in untyped λ-calculus are formalized in Isabelle/HOL, an implementation of Higher Order Logic in the generic theorem prover Isabelle. For β-reduction, both the standard proof and Takahashi's are given and compared. All proofs are based on a general theory of commutating relations that supports an almost geometric style of reasoning about confluence diagrams.
AB - The proofs of the Church-Rosser theorems for β, η, and βqqη reduction in untyped λ-calculus are formalized in Isabelle/HOL, an implementation of Higher Order Logic in the generic theorem prover Isabelle. For β-reduction, both the standard proof and Takahashi's are given and compared. All proofs are based on a general theory of commutating relations that supports an almost geometric style of reasoning about confluence diagrams.
UR - http://www.scopus.com/inward/record.url?scp=0034836793&partnerID=8YFLogxK
U2 - 10.1023/A:1006496715975
DO - 10.1023/A:1006496715975
M3 - Article
AN - SCOPUS:0034836793
SN - 0168-7433
VL - 26
SP - 51
EP - 66
JO - Journal of Automated Reasoning
JF - Journal of Automated Reasoning
IS - 1
ER -