Intersection Types and Runtime Errors in the Pi-Calculus

Ugo Dal Lago (1, 2) , Marc de Visme (3) , Damiano Mazza (4) , Akira Yoshimizu (2)

1 DISI - Dipartimento di Scienze dell'Informazione [Bologna]
2 FOCUS - Foundations of Component-based Ubiquitous Systems
3 LIP - Laboratoire de l'Informatique du Parallélisme
4 LIPN - Laboratoire d'Informatique de Paris-Nord

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.

Mots clés: Process calculi; Linear logic; Type structures; Intersection types; π -calculus

Domaines: Logique en informatique [cs.LO]

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⟩