scispace - formally typeset
Open AccessJournal ArticleDOI

Semantic subtyping for the pi-calculus

Reads0
Chats0
TLDR
A variant of the @p-calculus where communication is subjected to pattern matching that performs dynamic typecase is defined, and it is proved decidability of the subtyping relation and sketch theSubtyping algorithm is sketched.
About
This article is published in Theoretical Computer Science.The article was published on 2008-05-20 and is currently open access. It has received 57 citations till now. The article focuses on the topics: Covariance and contravariance & Subtyping.

read more

Citations
More filters
Journal ArticleDOI

Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types

TL;DR: This work shows how to define a subtyped relation semantically in the presence of Boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm.
Proceedings ArticleDOI

Foundations of session types

TL;DR: A streamlined theory of session types based on a simple yet general and expressive formalism whose main eatures are semantically characterized and where each design choice is semantically justified.
Book ChapterDOI

Full abstraction in a subtyped pi-calculus with linear types

TL;DR: A concise pi-calculus with directed choices and a theory of subtyping, which shows type-directed embeddings of two known subtyped calculi, one for functions and another for session-based communications, and introduces a new proof method centring on non-deterministic computational adequacy and definability.
Journal Article

On the Preciseness of Subtyping in Session Types.

TL;DR: This paper formalises preciseness (i.e. both soundness and completeness) of subtyping for mobile processes and studies it for the synchronous and the asynchronous session calculi and proposes an asynchronous subtyped system which is sound and complete for the asynchronous calculus.
Journal ArticleDOI

Set-theoretic foundation of parametric polymorphism and subtyping

TL;DR: The notion of "convexity" on which the solution is built up is introduced and its connections with parametricity as defined by Reynolds are discussed to whose study the work sheds new light.
References
More filters
Book ChapterDOI

An Object Calculus for Asynchronous Communication

TL;DR: This paper shows basic construction of the formal system along with several illustrative examples of the communication primitive, which results in a consistent reduction of Milner's calculus, while retaining the same expressive power.
Proceedings ArticleDOI

Typing and subtyping for mobile processes

TL;DR: The authors define the syntax, typing, subtyping, and operational semantics of their calculus, prove that the typing rules are sound, apply the system to Milner's lambda -calculus encodings, and sketch extensions to higher-order process calculi and polymorphic typing.
Journal ArticleDOI

Typing and subtyping for mobile processes

TL;DR: In this paper, the authors extend Milner's language of types by distinguishing between the ability to read from a channel, ability to write to a channel and the ability both to read and to write.
Proceedings ArticleDOI

CDuce: an XML-centric general-purpose language

TL;DR: This work presents the functional language CDuce, discusses some design issues, and shows its adequacy for working with XML documents, including a dispatch algorithm that demonstrates how static type information can be used to obtain very efficient compilation schemas.
Journal ArticleDOI

Resource Access Control in Systems of Mobile Agents

TL;DR: A typing system for a distributed ?