Skip to main content
Log in

λ-definable functionals andβη conversion

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Curry, H.B., Feys, R.: Combinatory logic, Vol. 1. Amsterdam: North-Holland 1968.

    Google Scholar 

  2. Friedman, H.: Equality between functionals. In: Parikh, R. (ed.): Lecture Notes in Mathematics, Vol. 453, pp. 22–37. Berlin, Heidelberg, New York: Springer 1975.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. Statman, R.: The typedλ-calculus is not elementary recursive. Theor. Comp. Sci.9, 73–81 (1979).

    Article  Google Scholar 

  5. Statman, R.: Completeness, invariance, andλ-definability. J. Symb. Logic (to appear).

  6. 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.

    Google Scholar 

  7. Zucker, J.: Proof theoretic studies of systems of iterated inductive definitions and subsystems of analysis. Dissertation, Stanford Univ. Dept. of Math. (1971).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023009

Keywords

Navigation