Intersections and Unions of Session Types

Coşku Acay
(Carnegie Mellon University)
Frank Pfenning
(Carnegie Mellon University)

Prior work has extended the deep, logical connection between the linear sequent calculus and session-typed message-passing concurrent computation with equi-recursive types and a natural notion of subtyping. In this paper, we extend this further by intersection and union types in order to express multiple behavioral properties of processes in a single type. We prove session fidelity and absence of deadlock and illustrate the expressive power of our system with some simple examples. We observe that we can represent internal and external choice by intersection and union, respectively, which was previously suggested by Padovani for a different language of session types motivated by operational rather than logical concerns.

In Naoki Kobayashi: Proceedings Eighth Workshop on Intersection Types and Related Systems (ITRS 2016), Porto, Portugal, 26th June 2016, Electronic Proceedings in Theoretical Computer Science 242, pp. 4–19.
Published: 7th February 2017.

ArXived at: http://dx.doi.org/10.4204/EPTCS.242.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org