A type checking algorithm for qualified session types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A type checking algorithm for qualified session types


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 typing system preserving typings during the computation and that type checking is consistent with respect to structural congruence.
Fichier principal
Vignette du fichier
wwv.pdf (157.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00644061 , version 1 (23-11-2011)



Marco Giunti. A type checking algorithm for qualified session types. 7th International Workshop on Automated Specification and Verification of Web Systems, Jun 2011, Reykjavik, Iceland. ⟨10.4204/EPTCS.61.7⟩. ⟨hal-00644061⟩
229 View
240 Download



Gmail Facebook X LinkedIn More