Skip to main content
Springer Nature Link
Log in

An upper bound for reduction sequences in the typed λ-calculus

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Diller, J.: Zur Berechenbarkeit primitiv-rekursiver Funktionale endlicher Typen. In: Schütte, K. (ed.) Contributions to mathematical logic. Amsterdam: North-Holland 1968, pp. 109–120

    Google Scholar 

  2. Gandy, R.O.: Proofs of strong normalization. In: Seldin, J.O., Hindley, J.R. (eds.) To H.B. Curry: Essays on combinatory logic, lambda calculus, and formalism. Academic Press 1980, pp. 457–477

  3. Howard, W.A.: Ordinal analysis of terms of finite type. J. Symb. Logic,45 (3), 493–504 (1980)

    Google Scholar 

  4. Sanchis, L.E.: Functional defined by recursion. Notre Dame J. Formal Logic8, 161–174 (1967)

    Google Scholar 

  5. Schwichtenberg, H.: Complexity of normalization in the pure typedλ-calculus. In: Troelstra, A.S., Dalen, D. van (eds.): The L.E.J. Brouwer Centenary Symposium. Proceedings of the Conference held in Noordwijkerhout, 8–13 June, 1981. North-Holland, Studies in Logic and the Foundations of Mathematics. Amsterdam 1982, pp. 453–458

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität München, Theresienstrasse 39, W-8000, München 2, Federal Republic of Germany

    Helmut Schwichtenberg

Authors
  1. Helmut Schwichtenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Kurt Schütte on the occasion of his 80th birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schwichtenberg, H. An upper bound for reduction sequences in the typed λ-calculus. Arch Math Logic 30, 405–408 (1991). https://doi.org/10.1007/BF01621476

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation