Loader and Urzyczyn Are Logically Related - Université Sorbonne Paris Nord
Communication Dans Un Congrès Année : 2012

Loader and Urzyczyn Are Logically Related

Résumé

In simply typed \lam-calculus with one ground type the following theorem due to Loader holds. $(i)$ Given the full model $\cF$ over a finite set, %with at least seven elements, the question whether some element $f\in\cF$ is \lam-definable is undecidable. In the \lam-calculus with intersection types based on countably many atoms, the following is proved by Urzyczyn. $(ii)$ It is undecidable whether a type is inhabited. Both statements are major results presented in \cite{Bare2}. We show that $(i)$ and $(ii)$ follow from each other in a natural way, by interpreting intersection types as continuous functions logically related to elements of $\cF$. From this, and a result by Joly on \lam-definability, we get that \Urz's theorem already holds for intersection types with at most two atoms.
Fichier principal
Vignette du fichier
BGMS.pdf (194.17 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00959623 , version 1 (14-03-2014)

Identifiants

  • HAL Id : hal-00959623 , version 1

Citer

Sylvain Salvati, Giulio Manzonetto, Mai Gehrke, Henk Barendregt. Loader and Urzyczyn Are Logically Related. ICALP, 2012, Warwick, France. pp.364-376. ⟨hal-00959623⟩
240 Consultations
167 Téléchargements

Partager

More