Uniqueness typing for intersection types
From MaRDI portal
Abstract: 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 admits a *uniqueness typing*, which is a pair such that 1) 2) We also discuss several presentations of intersection type algebras, and the corresponding choices of type assignment rules.
This page was built for publication: Uniqueness typing for intersection types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366940)