Hostname: page-component-76fb5796d-zzh7m Total loading time: 0 Render date: 2024-04-26T05:38:49.023Z Has data issue: false hasContentIssue false
  • English
  • Français

Exact bounds for lengths of reductions in typed λ-calculus

Published online by Cambridge University Press:  12 March 2014

Arnold Beckmann
Arnold Beckmann*
Affiliation:
Institut für Mathematische Logik, und Grundlagenforschung, Der Westfälischen Wilhelms-Universität Münster, Einsteinstr. 62, D-48149 Münster, Germany, E-mail: Arnold.Beckmann@math.uni-muenster.de
Get access Rights & Permissions [Opens in a new window]

Abstract

We determine the exact bounds for the length of an arbitrary reduction sequence of a term in the typed λ-calculus with β-, ξ- and η-conversion. There will be two essentially different classifications, one depending on the height and the degree of the term and the other depending on the length and the degree of the term.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 66 , Issue 3 , September 2001 , pp. 1277 - 1285
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Barendregt, H. P., The lambda calculus, Studies in Logic, vol. 103, North-Holland, 1984.Google Scholar
[2]Goguen, H., A typed operational semantics for type theory, Ph.D. thesis, University of Edinburgh, 1994.CrossRefGoogle Scholar
[3]Loader, R., Notes on simply typed lambda calculus, Technical Report ECS-LFCS-98-381, Edinburgh.Google Scholar
[4]Schwichtenberg, H., Complexity of normalization in the pure typed lambda - calculus, The L. E. J. Brouwer centenary symposium (Troelstra, A. S. and van Dalen, D., editors), North-Holland, 1982, pp. 453–457.Google Scholar
[5]Schwichtenberg, H., An upper bound for reduction sequences in the typed λ-calculus, Archive of Mathematical Logic, vol. 30 (1991), pp. 405–408.CrossRefGoogle Scholar
[6]van Raamsdonk, F. and Severi, P., On normalisation, Computer Science Report CS-R9545, Centrum for Wiskunde en Informatica, 1995.Google Scholar