%P 92-101
%R 10.1109/LICS.2005.46
%T Semantic Subtyping for the p-Calculus
%B Logic in Computer Science, 2005. LICS 2005. Proceedings. 20th Annual IEEE Symposium on
%O IEEE terms:
Communication channels , Educational institutions , Equations , Pattern matching , Testing

INSPEC:

    Controlled Indexing
    Boolean algebra , decidability , pattern matching , pi calculus , set theory , type theory

    Non Controlled Indexing
    Boolean combinations , decidability , pattern matching , semantic subtyping relations , set-theoretic interpretation , type system , ?-calculus


%L eprints307
%I IEEE Computer Society
%X 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 are interpreted as the corresponding set-theoretic operations. Subtyping is defined as inclusion of the interpretations. We prove the 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.
%D 2005
%A Giuseppe Castagna
%A Rocco De Nicola
%A Daniele Varacca