Advertisement

“Delayability” in proofs of strong normalizability in the typed lambda Calculus

  • Michael Karr
Colloquium On Trees In Algebra And Programming Rewriting
Part of the Lecture Notes in Computer Science book series (LNCS, volume 185)

Keywords

Free Variable Transitive Closure Linear Pattern Infinite Path Prime Pattern 
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

  1. 1.
    Barendregt, H.P. The Lambda Calculus. North Holland, 1981.Google Scholar
  2. 2.
    Bercovici, I. Tait's method and strong normalizability of pairing rules. UnpublishedGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Karr, M. Tait's method and surjective pairing. UnpublishedGoogle Scholar
  5. 5.
    Karr, M. “Delayability” in Proofs of Strong Normalizability in the Typed Lambda Calculus. UnpublishedGoogle Scholar
  6. 6.
    Klop, J.W. Combinatory Reduction Systems. Mathematisch Centrum Amsterdam, 1980.Google Scholar
  7. 7.
    Nederpelt, R.P. Strong Normalization in a Typed λ-Calculus with Lambda Structured Types. Ph.D. Th., The University of Technology, Eindhoven, 1973.Google Scholar
  8. 8.
    Tait, W.W. Intensional Interpretations of Functionals of Finite Type I. J. of Symbolic Logic 32 (1967), 198–212.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Michael Karr
    • 1
  1. 1.Software Options, Inc.Cambridge

Personalised recommendations