Session types revisited

Dardha, O. , Giachino, E. and Sangiorgi, D. (2012) Session types revisited. In: 14th International Symposium on Principles and Practice of Declarative Programming, Leuven, Belgium, 19-21 Sep 2012, pp. 139-149. (doi:10.1145/2370776.2370794)

Full text not currently available from Enlighten.

Publisher's URL:


Session types are a formalism to model structured communication-based programming. A session type describes communication by specifying the type and direction of data exchanged between two parties. When session types and session primitives are added to the syntax of standard pi-calculus types and terms, they give rise to additional separate syntactic categories. As a consequence, when new type features are added, there is duplication of efforts in the theory: the proofs of properties must be checked both on ordinary types and on session types. We show that session types are encodable in ordinary pi types, relying on linear and variant types. Besides being an expressivity result, the encoding (i) removes the above redundancies in the syntax, and (ii) the properties of session types are derived as straightforward corollaries, exploiting the corresponding properties of ordinary pi types. The robustness of the encoding is tested on a few extensions of session types, including subtyping, polymorphism and higher-order communications.

Item Type:Conference Proceedings
Keywords:session types, linear types, pi-calculus, encoding
Glasgow Author(s) Enlighten ID:Dardha, Dr Ornela
Authors: Dardha, O., Giachino, E., and Sangiorgi, D.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science

University Staff: Request a correction | Enlighten Editors: Update this record