Intersection Types and Runtime Errors in the Pi-Calculus - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Proceedings of the ACM on Programming Languages Année : 2019

Intersection Types and Runtime Errors in the Pi-Calculus

Résumé

We introduce a type system for the π-calculus which is designed to guarantee that typable processes are well-behaved, namely they never produce a run-time error and, even if they may diverge, there is always a chance for them to łfinish their workž, i.e., to reduce to an idle process. The introduced type system is based on non-idempotent intersections, and is thus very powerful as for the class of processes it can capture. Indeed, despite the fact that the underlying property is Π 0 2-complete, there is a way to show that the system is complete, i.e., that any well-behaved process is typable, although for obvious reasons infinitely many derivations need to be considered.
Fichier principal
Vignette du fichier
ITPi.pdf (451.33 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02399565 , version 1 (09-12-2019)

Identifiants

Citer

Ugo Dal Lago, Marc de Visme, Damiano Mazza, Akira Yoshimizu. Intersection Types and Runtime Errors in the Pi-Calculus. Proceedings of the ACM on Programming Languages, 2019, 3 (POPL), pp.1-29. ⟨10.1145/3290320⟩. ⟨hal-02399565⟩
78 Consultations
73 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More