DeepAI AI Chat
Log In Sign Up

On sets of terms with a given intersection type

by   Richard Statman, et al.
Carnegie Mellon University

We are interested in how much of the structure of a strongly normalizable lambda term is captured by its intersection types and how much all the terms of a given type have in common. In this note we consider the theory BCD (Barendregt, Coppo, and Dezani) of intersection types without the top element. We show: for each strongly normalizable lambda term M, with beta-eta normal form N, there exists an intersection type A such that, in BCD, N is the unique beta-eta normal term of type A. A similar result holds for finite sets of strongly normalizable terms for each intersection type A if the set of all closed terms M such that, in BCD, M has type A, is infinite then, when closed under beta-eta conversion, this set forms an adaquate numeral system for untyped lambda calculus. A number of related results are also proved.


page 1

page 2

page 3

page 4


Uniqueness typing for intersection types

Working in a variant of the intersection type assignment system of Coppo...

Intersection Types for Unboundedness Problems

Intersection types have been originally developed as an extension of sim...

The intersection of algorithmically random closed sets and effective dimension

In this article, we study several aspects of the intersections of algori...

Revisiting Decidable Bounded Quantification, via Dinaturality

We use a semantic interpretation to investigate the problem of defining ...

Profinite lambda-terms and parametricity

Combining ideas coming from Stone duality and Reynolds parametricity, we...

On the Definition of the Eta-long Normal Form in Type Systems of the Cube

The smallest transitive relation < on well-typed normal terms such that ...

Statman's Hierarchy Theorem

In the Simply Typed λ-calculus Statman investigates the reducibility rel...