Polyadic approximations, fibrations and intersection types - Archive ouverte HAL
Article Dans Une Revue Proceedings of the ACM on Programming Languages Année : 2017

Polyadic approximations, fibrations and intersection types

Résumé

Starting from an exact correspondence between linear approximations and non-idempotent intersection types, we develop a general framework for building systems of intersection types characterizing normalization properties. We show how this construction, which uses in a fundamental way Melliès and Zeilberger's ``type systems as functors'' viewpoint, allows us to recover equivalent versions of every well known intersection type system (including Coppo and Dezani's original system, as well as its non-idempotent variants independently introduced by Gardner and de Carvalho). We also show how new systems of intersection types may be built almost automatically in this way.
Fichier principal
Vignette du fichier
3158094.pdf (379.48 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04709336 , version 1 (25-09-2024)

Identifiants

Citer

Damiano Mazza, Luc Pellissier, Pierre Vial. Polyadic approximations, fibrations and intersection types. Proceedings of the ACM on Programming Languages, 2017, 2 (POPL), pp.1-28. ⟨10.1145/3158094⟩. ⟨hal-04709336⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More