Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CDuce: an XML-centric general-purpose language
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Parametric polymorphism for XML
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A gentle introduction to semantic subtyping
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Semantic Subtyping for the p-Calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Semantic subtyping: challenges, perspectives, and open problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
XPi: a typed process calculus for XML messaging
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Encoding CDuce in the Cπ-calculus
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types
Journal of the ACM (JACM)
A formal model of provenance in distributed systems
TAPP'09 First workshop on on Theory and practice of provenance
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Set-theoretic foundation of parametric polymorphism and subtyping
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Full abstraction in a subtyped pi-calculus with linear types
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Fair subtyping for open session types
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Hi-index | 5.23 |
Subtyping relations for the @p-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 @p-calculus where communication is subjected to pattern matching that performs dynamic typecase.