
Inhabitation for Nonidempotent Intersection Types
The inhabitation problem for intersection types in the lambdacalculus i...
read it

On sets of terms with a given intersection type
We are interested in how much of the structure of a strongly normalizabl...
read it

Modelling of crash types at signalized intersections based on random effect model
Approachlevel models were developed to accommodate the diversity of app...
read it

Intersection Subtyping with Constructors
We study the question of extending the BCD intersection type system with...
read it

Descriptive Unions. A Fibre Bundle Characterization of the Union of Descriptively Near Sets
This paper introduces an extension of descriptive intersection and provi...
read it

Almost Sure Uniqueness of a Global Minimum Without Convexity
This paper provides a theorem for the set of global minimizers, the argm...
read it

Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof
Type classes are one of Haskell's most popular features and extend its t...
read it
Uniqueness typing for intersection types
Working in a variant of the intersection type assignment system of Coppo, DezaniCiancaglini 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.
READ FULL TEXT
Comments
There are no comments yet.