Typing untyped λ-terms, or Reducibility strikes again!

Thumbnail Image
Penn collection
IRCS Technical Reports Series
Degree type
Grant number
Copyright date
Related resources

It was observed by Curry that when (untyped) λ -terms can be assigned types,for example,simple types,these terms have nice properties (for example, they are strongly normalizing. Coppo, Dezani, and Veneri, introduced type systems using conjunctive types, and showed that several important classes of (untyped) terms can be characterized according to the shape of the types that can be assigned to these terms. For example, the strongly ormalizable terms, the normalizable terms, and the terms having head-normal forms, can be characterized in some systems D and DΩ. 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 D and DΩ. 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 headnormal forms, which appears to be new. We conclude by stating a number of challenging open problems regarding possible generalizations of the realizability method.

Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
Volume number
Issue number
Publisher DOI
Journal Issue
University of Pennsylvania Institute for Research in Cognitive Science Technical Report No. IRCS-95-26.
Recommended citation