DeepAI AI Chat

Uniqueness typing for intersection types

05/05/2021

∙

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.

Richard Statman
3 publications
Andrew Polonsky
4 publications

page 1

page 2

page 3

page 4

∙ 12/11/2017

Inhabitation for Non-idempotent Intersection Types

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

0 Antonio Bucciarelli, et al. ∙

∙ 09/19/2018

On sets of terms with a given intersection type

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

0 Richard Statman, et al. ∙

∙ 05/16/2018

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

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

0 Xuesong Wang, et al. ∙

∙ 04/26/2022

Structural Rules and Algebraic Properties of Intersection Types

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

0 Sandra Alves, et al. ∙

∙ 04/23/2019

Intersection Subtyping with Constructors

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

0 Olivier Laurent, et al. ∙

∙ 03/06/2018

Almost Sure Uniqueness of a Global Minimum Without Convexity

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

0 Gregory Cox, et al. ∙

∙ 11/23/2022

Improved Elekes-Szabó type estimates using proximity

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

0 Jozsef Solymosi, et al. ∙