Fundamental theorems of extensional untyped $\lambda$-calculus revisited

Fundamental theorems of extensional untyped $\lambda$-calculus revisited

This paper presents new proofs of three following fundamental theorems of the untyped extensional $\lambda$-calculus: the $\eta$-Postpo-nement theorem, the $\beta\eta$-Normal form theorem, and the Norma-lization theorem for $\beta\eta$-reduction. These proofs do not involve any special extensions of...

Full description

Bibliographic Details
Main Author: Alexandre Lyaletsky
Format: Article
Language:English
Published: Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova 2015-10-01
Series:Computer Science Journal of Moldova
Subjects:
extensional untyped $\lambda$-calculus
$\beta\eta$-reduction
postponement of $\eta$-reduction
$\eta$-Postponement theorem
$\beta\eta$-Nor-mal form theorem
Normalization theorem for $\beta\eta$-reduction
Online Access:http://www.math.md/files/csjm/v23-n2/v23-n2-(pp153-164).pdf

Internet

http://www.math.md/files/csjm/v23-n2/v23-n2-(pp153-164).pdf

Similar Items