Part of this work was done at Harvard University, where the author was supported by an IBM graduate fellowship.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Bibliography
Barendregt, H.P. The Lambda Calculus. North Holland, 1981.
Bercovici, I. Tait's method and strong normalizability of pairing rules. Unpublished
Gandy, R.O. Proofs of Strong Normalization. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 457–477. Academic Press, 1980.
Karr, M. Tait's method and surjective pairing. Unpublished
Karr, M. “Delayability” in Proofs of Strong Normalizability in the Typed Lambda Calculus. Unpublished
Klop, J.W. Combinatory Reduction Systems. Mathematisch Centrum Amsterdam, 1980.
Nederpelt, R.P. Strong Normalization in a Typed λ-Calculus with Lambda Structured Types. Ph.D. Th., The University of Technology, Eindhoven, 1973.
Tait, W.W. Intensional Interpretations of Functionals of Finite Type I. J. of Symbolic Logic 32 (1967), 198–212.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karr, M. (1985). “Delayability” in proofs of strong normalizability in the typed lambda Calculus. In: Ehrig, H., Floyd, C., Nivat, M., Thatcher, J. (eds) Mathematical Foundations of Software Development. CAAP 1985. Lecture Notes in Computer Science, vol 185. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15198-2_13
Download citation
DOI: https://doi.org/10.1007/3-540-15198-2_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15198-2
Online ISBN: 978-3-540-39302-3
eBook Packages: Springer Book Archive