<> "The repository administrator has not yet configured an RDF license."^^ . <> . . . "Semantic Subtyping for the p-Calculus"^^ . "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."^^ . "2005" . . "IEEE Computer Society"^^ . . "IEEE Computer Society"^^ . . . . . . . . . . . . . . "Rocco"^^ . "De Nicola"^^ . "Rocco De Nicola"^^ . . "Daniele"^^ . "Varacca"^^ . "Daniele Varacca"^^ . . "Giuseppe"^^ . "Castagna"^^ . "Giuseppe Castagna"^^ . . . . . "HTML Summary of #307 \n\nSemantic Subtyping for the p-Calculus\n\n" . "text/html" . . . "QA75 Electronic computers. Computer science"@en . .