DeepAI AI Chat
Log In Sign Up

Uniqueness typing for intersection types

by   Richard Statman, et al.

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Veneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing term M admits a *uniqueness typing*, which is a pair (Γ,A) such that 1) Γ⊢ M : A 2) Γ⊢ N : A ⟹ M =_βη N We also discuss several presentations of intersection type algebras, and the corresponding choices of type assignment rules.


page 1

page 2

page 3

page 4


Inhabitation for Non-idempotent Intersection Types

The inhabitation problem for intersection types in the lambda-calculus i...

On sets of terms with a given intersection type

We are interested in how much of the structure of a strongly normalizabl...

Modelling of crash types at signalized intersections based on random effect model

Approach-level models were developed to accommodate the diversity of app...

Structural Rules and Algebraic Properties of Intersection Types

In this paper we define several notions of term expansion, used to defin...

Intersection Subtyping with Constructors

We study the question of extending the BCD intersection type system with...

Almost Sure Uniqueness of a Global Minimum Without Convexity

This paper provides a theorem for the set of global minimizers, the argm...

Improved Elekes-Szabó type estimates using proximity

We prove a new Elekes-Szabó type estimate on the size of the intersectio...