A type checking algorithm for qualified session types

Marco Giunti
(INRIA and LIX, Ecole Polytechnique, France )

We present a type checking algorithm for establishing a session-based discipline in the pi calculus of Milner, Parrow and Walker. Our session types are qualified as linear or unrestricted. Linearly typed communication channels are guaranteed to occur in exactly one thread, possibly multiple times; afterwards they evolve as unrestricted channels. Session protocols are described by a type constructor that denotes the two ends of one and the same communication channel. We ensure the soundness of the algorithm by showing that processes consuming all linear resources are accepted by a type system preserving typings during the computation and that type checking is consistent w.r.t. structural congruence.

In Laura Kovacs, Rosario Pugliese and Francesco Tiezzi: Proceedings 7th International Workshop on Automated Specification and Verification of Web Systems (WWV 2011), Reykjavik, Iceland, 9th June 2011, Electronic Proceedings in Theoretical Computer Science 61, pp. 96–114.
Published: 10th August 2011.

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