Typing untyped λ-terms, or reducibility strikes again!

Annals of Pure and Applied Logic 91 (2-3):231-270 (1998)
  Copy   BIBTEX

Abstract

It was observed by Curry that when λ-terms can be assigned types, for example, simple types, these terms have nice properties . Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of terms can be characterized according to the shape of the types that can be assigned to these terms. For example, the strongly normalizable terms, the normalizable terms, and the terms having head-normal forms, can be characterized in some systems and Ω. The proofs use variants of the method of reducibility. In this paper, we present a uniform approach for proving several meta-theorems relating properties of λ-terms and their typability in the systems and Ω. Our proofs use a new and more modular version of the reducibility method. As an application of our metatheorems, we show how the characterizations obtained by Coppo, Dezani, Veneri, and Pottinger, can be easily rederived. We also characterize the terms that have weak head-normal forms, which appears to be new. We conclude by stating a number of challenging open problems regarding possible generalizations of the realizability method

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,888

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Normalization without reducibility.René David - 2000 - Annals of Pure and Applied Logic 107 (1-3):121-130.
Extended Curry‐Howard terms for second‐order logic.Pimpen Vejjajiva - 2013 - Mathematical Logic Quarterly 59 (4-5):274-285.
A classification of intersection type systems.M. W. Bunder - 2002 - Journal of Symbolic Logic 67 (1):353-368.
An elementary proof of strong normalization for intersection types.Valentini Silvio - 2001 - Archive for Mathematical Logic 40 (7):475-488.
Classical Fω, orthogonality and symmetric candidates.Stéphane Lengrand & Alexandre Miquel - 2008 - Annals of Pure and Applied Logic 153 (1-3):3-20.
A semantical storage operator theorem for all types.Christophe Raffalli - 1998 - Annals of Pure and Applied Logic 91 (1):17-31.
Inductive types and type constraints in the second-order lambda calculus.Nax Paul Mendler - 1991 - Annals of Pure and Applied Logic 51 (1-2):159-172.

Analytics

Added to PP
2014-01-16

Downloads
20 (#1,038,527)

6 months
12 (#294,748)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Normalization without reducibility.René David - 2000 - Annals of Pure and Applied Logic 107 (1-3):121-130.

Add more citations

References found in this work

Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
Functional Characters of Solvable Terms.M. Coppo, M. Dezani-Ciancaglini & B. Venneri - 1981 - Mathematical Logic Quarterly 27 (2-6):45-58.
On the correspondence between proofs and lamba-terms.J. Gallier - 1995 - In Philippe De Groote (ed.), The Curry-Howard isomorphism. Louvain-la-Neuve: Academia.
Church-Rosser theorem for typed functional systems.George Koletsos - 1985 - Journal of Symbolic Logic 50 (3):782-790.

View all 6 references / Add more references