An elementary proof of the normalization theorem for -reduction

zbMATH Open1313.03004MaRDI QIDQ2933396FDOQ2933396

Authors: O. O. Lyalets'kyj 

Publication date: 10 December 2014

Recommendations

• A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus
• New proofs of important theorems of untyped extensional \(\lambda\) calculus
• scientific article; zbMATH DE number 512779
• Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters
• Fundamental theorems of extensional untyped \(\lambda\)-calculus revisited

zbMATH Keywords

lambda calculusnormalization theorem\(\beta\eta\)-reductionleftmost strategy

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (3)

• A proof of the leftmost reduction theorem for \(\lambda\beta\eta\)-calculus
• New proofs of important theorems of untyped extensional \(\lambda\) calculus
• Title not available (Why is that?)

This page was built for publication: An elementary proof of the normalization theorem for \(\beta\eta\)-reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933396)