TY  - JOUR
ID  - eprints285
EP  - 242
N2  - Subtyping relations for the ?-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-only and write-only channel types, as well as boolean combinations of types. A set-theoretic interpretation of types is provided, in which boolean combinations of types are interpreted as the corresponding set-theoretic operations. Subtyping is defined as inclusion of the interpretations. We prove decidability of the subtyping relation and sketch the subtyping algorithm.

In order to fully exploit the type system, we define a variant of the ?-calculus where communication is subjected to pattern matching that performs dynamic typecase.
SN  - 0304-3975
IS  - 1-3
JF  - Theoretical Computer Science
PB  - Elsevier
SP  - 217
TI  - Semantic subtyping for the pi-calculus
AV  - none
KW  - Concurrency; Pi-calculus; Types; Subtyping; Channels; Boolean type combinators
UR  - http://www.sciencedirect.com/science/article/pii/S0304397508000698
A1  - Castagna, Giuseppe
A1  - De Nicola, Rocco
A1  - Varacca, Daniele
Y1  - 2008///
VL  - 398
ER  -