References
Curry, H.B., Feys, R.: Combinatory logic, Vol. 1. Amsterdam: North-Holland 1968.
Friedman, H.: Equality between functionals. In: Parikh, R. (ed.): Lecture Notes in Mathematics, Vol. 453, pp. 22–37. Berlin, Heidelberg, New York: Springer 1975.
Plotkin, G.D.: Lambda definability in the full type hierarchy. In: Hindley, R., Seldin, J. (eds.): Combinatory logic, lambda calculus, and formal systems. New York: Academic Press 1980.
Statman, R.: The typedλ-calculus is not elementary recursive. Theor. Comp. Sci.9, 73–81 (1979).
Statman, R.: Completeness, invariance, andλ-definability. J. Symb. Logic (to appear).
Statman, R.: On the existence of closed terms in the typedλ-calculus. I. In: Hindley, R., Seldin, J. (eds.): Combinatory logic, lambda calculus, and formal systems. New York: Academic Press 1980.
Zucker, J.: Proof theoretic studies of systems of iterated inductive definitions and subsystems of analysis. Dissertation, Stanford Univ. Dept. of Math. (1971).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Statman, R. λ-definable functionals andβη conversion. Arch math Logik 23, 21–26 (1983). https://doi.org/10.1007/BF02023009
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02023009