Abstract
In this work we present an extension of the linear typing discipline for π-calculus, introduced by Yoshida, Honda and Berger, with Intersection and Union Types. We show that we are able to define a typing system for the π-calculus, which guarantees that every well-typed term is strongly normalizing. This typing system is an extension of that presented in [30] since it is able to type more terms than that presented there.
Get full access to this article
View all access options for this article.