Which simple types have a unique inhabitant? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Which simple types have a unique inhabitant?


We study the question of whether a given type has a unique inhabitant modulo program equivalence. In the setting of simply-typed lambda-calculus with sums, equipped with the strong βη-equivalence, we show that uniqueness is decidable. We present a saturating focused logic that introduces irreducible cuts on positive types "as soon as possible". Backward search in this logic gives an effective algorithm that returns either zero, one or two distinct inhabitants for any given type. Preliminary application studies show that such a feature can be useful in strongly-typed programs, inferring the code of highly-polymorphic library functions, or "glue code" inside more complex terms.
Fichier principal
Vignette du fichier
unique_stlc_sums.pdf (404.52 Ko) Télécharger le fichier
unique-stlc-sums-implem.zip (25.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other
Origin : Files produced by the author(s)
Comment : Implémentation

Dates and versions

hal-01235596 , version 1 (30-11-2015)


  • HAL Id : hal-01235596 , version 1


Gabriel Scherer, Didier Rémy. Which simple types have a unique inhabitant?. The 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015), Aug 2015, Vancouver, Canada. ⟨hal-01235596⟩


83 View
140 Download


Gmail Facebook Twitter LinkedIn More