Abstract
This paper contains new proofs of the following two theorems of the untyped extensional λ-calculus: the Curry theorem stating that any λ-term has a βη-normal form if and only if it has a β-normal form and the normalization theorem for βη-reduction. The proposed approach is based on the following well-known results: the postponement theorem of η-reduction and the strong normalization property of η-reduction that allow one to naturally extend some propositions from the usual λ-calculus to the extensional case.
Similar content being viewed by others
References
H. P. Barendregt, The Lambda Calculus, Its Syntax and Semantics [Russian translation], Mir, Moscow (1985).
H. B. Curry, R. Feyes, and W. Craig, Combinatory Logic, Vol. 1, North-Holland, Amsterdam (1958).
H. B. Curry, J. R. Hindley, and J. P. Seldinn, Combinatory Logic, Vol. 2, North-Holland, Amsterdam (1972).
H. P. Barendregt, J. Bergstra, J. W. Klop, and H. Voken, “Some notes on lambda reduction,” in: Degrees, Reductions, and Representability in the Lambda Calculus, Univ. of Utrecht, Dep. of Math., Preprint No. 22 (1976), pp. 13–53.
J. W. Klop, “Combinatory reduction systems,” Ph.D. Thesis, Univ. of Utrecht (1980).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 53–63, July–August, 2014.
Rights and permissions
About this article
Cite this article
Lyaletsky, A.A. New Proofs of Important Theorems of Untyped Extensional λ Calculus. Cybern Syst Anal 50, 529–537 (2014). https://doi.org/10.1007/s10559-014-9641-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-014-9641-5