Hostname: page-component-76fb5796d-5g6vh Total loading time: 0 Render date: 2024-04-26T22:47:35.676Z Has data issue: false hasContentIssue false
  • English
  • Français

Upper bounds for standardizations and an application

Published online by Cambridge University Press:  12 March 2014

Hongwei Xi
Hongwei Xi*
Affiliation:
Department of Mathematical Sciences, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, Pa 15213, USA E-mail: hwxi+@cs.cmu.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We present a new proof for the standardization theorem in λ-calculus, which is largely built upon a structural induction on λ-terms. We then extract some bounds for the number of β-reduction steps in the standard β-reduction sequence obtained from transforming a given β-reduction sequence, sharpening the standardization theorem. As an application, we establish a super exponential bound for the lengths of β-reduction sequences from any given simply typed λ-terms.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 64 , Issue 1 , March 1999 , pp. 291 - 303
Copyright
Copyright © Association for Symbolic Logic 1999

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]Andrews, P.B., Resolution in type theory, this Journal, vol. 36 (1971), pp. 414–432.Google Scholar
[2]Barendregt, H.P., The lambda calculus: Its syntax and semantics, North-Holland publishing company, Amsterdam, 1984.Google Scholar
[3]Berry, G., Séquentialité de l'évaluation formelle des λ-expressions, Proc. 3-e Colloque International sur la Programmation, Paris, 1978.Google Scholar
[4]Church, A., The calculi of lambda conversion, Princeton University Press, Princeton, 1941.Google Scholar
[5]Curry, H.B. and Feys, R., Combinatory logic, North-Holland Publishing Company, Amsterdam, 1958.Google Scholar
[6]de Vrijer, R., A direct proof of the finite developments theorem, this Journal, vol. 50 (1985), pp. 339–343.Google Scholar
[7]Gandy, R.O., An early proof of normalization by A.M. Turing, To: H.B. Curry: Essays on combinatory logic, lambda calculus and formalism, Academic Press, 1980, pp. 453–456.Google Scholar
[8]Gandy, R.O., Proofs of strong normalization, To: H.B. Curry: Essays on combinatory logic, lambda calculus and formalism, Academic Press, 1980, pp. 457–478.Google Scholar
[9]Girard, J.-Y.et al., Proofs and types, Cambridge Press, 1989.Google Scholar
[10]Gonthier, G., Lévy, J.J., and Melliès, P.-A., An abstract standardization theorem, Proceedings of logic in computer science, 1992, pp. 72–81.Google Scholar
[11]Hindley, J.R., Reductions of residuals are finite, Transactions of the American Mathematical Society, vol. 240 (1978), pp. 345–361.CrossRefGoogle Scholar
[12]Howard, W., Ordinal analysis of terms of finite type, this Journal, vol. 45(3) (1980), pp. 493–504.Google Scholar
[13]Huet, Gérard, Residual theory in λ-calculus: A formal development, Journal of Functional Programming, vol. 4 (1994), pp. 371–394.CrossRefGoogle Scholar
[14]Hyland, J.M.E., A simple proof of the Church-Rosser theorem, Typescript, Oxford University, 1973.Google Scholar
[15]Kahrs, Stefan, Towards a domain theory for termination proofs, Technical Report 95-314, Laboratory for Foundation of Computer Science, Department of Computer Science, The University of Edinburgh, 1995.Google Scholar
[16]Klop, J.W., Combinatory Reduction Systems, Ph.D. thesis, CWI, Amsterdam, Mathematical center tracts, No. 127, 1980.Google Scholar
[17]Lévy, J.-J., Réductions correctes et optimales dans le lambda calcul, Technical report, Université Paris VII, 1978, Thèse de doctorat d'état.Google Scholar
[18]Mints, G.E., A primitive recursive bound of strong normalization for predicate calculus, Zapiski Naucnyh Seminarov Leningradskogo Otdelenija Matematiceskogo Instituta im V.A. Steklova Akademii Nauk SSSR (LOMI), vol. 88 (1979), pp. 131–135.Google Scholar
[19]Mitschke, G., The standardization theorem for the λ-calculus, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 25 (1979), pp. 29–31.CrossRefGoogle Scholar
[20]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 publishing company, 1982, pp. 453–457.Google Scholar
[21]Schwichtenberg, H., An upper bound for reduction sequences in the typed lambda-calculus, Archive for Mathematical Logic, vol. 30 (1991), pp. 405–408.CrossRefGoogle Scholar
[22]Statman, Richard, The typed λ-calculus is not elementary, Theoretical Computer Science, vol. 9 (1979), pp. 73–81.CrossRefGoogle Scholar
[23]Takahashi, Masako, Parallel reductions in λ-calculus, Information and Computation, vol. 118 (1995), pp. 120–127.CrossRefGoogle Scholar
[24]van de Pol, J., Strict functionals for termination proofs, (Heering, J., editor), Lecture Notes in Computer Science 902, 1994, pp. 350–364.Google Scholar
[25]Wadsworth, C.P., The relation between computational and denotational properties for Scott's D∞-models of λ-calculus, SIAM Journal of Computing, vol. 5(3) (1976), pp. 488–521.CrossRefGoogle Scholar
[26]Xi, H., An induction measure on λ-terms and its applications, Technical Report 96-192, Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, 1996.Google Scholar
[27]Xi, H., Separating developments in λ-calculus, manuscripts, 1996.Google Scholar
[28]Xi, H., Weak and strong beta normalisations in typed lambda-calculi, 3rd International conference on typed lambda-calculi and applications, Lecture Notes in Computer Science, vol. 1210, Nancy, 1997, pp. 390–404.CrossRefGoogle Scholar