Every $λ$-Term is Meaningful for the Infinitary Relational Model

Pierre Vial 1
1 GALLINETTE - GALLINETTE
Inria Rennes – Bretagne Atlantique , LS2N - Laboratoire des Sciences du Numérique de Nantes
Abstract : Infinite types and formulas are known to have really curious and unsound behaviors. For instance, they allow to type $Ω$, the auto-autoapplication and they thus do not ensure any form of normal-ization/productivity. Moreover, in most infinitary frameworks, it is not difficult to define a type R that can be assigned to every $λ$-term. However, these observations do not say much about what coinductive (i.e. infinitary) type grammars are able to provide: it is for instance very difficult to know what types (besides R) can be assigned to a given term in this setting. We begin with a discussion on the expressivity of different forms of infinite types. Then, using the resource-awareness of sequential intersection types (system S) and tracking, we prove that infinite types are able to characterize the arity of every λ-terms and that, in the infinitary extension of the relational model, every term has a " meaning " i.e. a non-empty denotation. From the technical point of view, we must deal with the total lack of guarantee of productivity for typable terms: we do so by importing methods inspired by first order model theory.
Type de document :
Communication dans un congrès
LICS 2018 - Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.1-26, 〈10.1145/nnnnnnn.nnnnnnn〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01840744
Contributeur : Pierre Vial <>
Soumis le : jeudi 26 juillet 2018 - 14:53:04
Dernière modification le : mardi 11 septembre 2018 - 11:10:48
Document(s) archivé(s) le : samedi 27 octobre 2018 - 12:11:11

Fichier

hal-inf-rel-mod-conf.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Pierre Vial. Every $λ$-Term is Meaningful for the Infinitary Relational Model. LICS 2018 - Thirty-Third Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2018, Oxford, United Kingdom. pp.1-26, 〈10.1145/nnnnnnn.nnnnnnn〉. 〈hal-01840744〉

Partager

Métriques

Consultations de la notice

89

Téléchargements de fichiers

25