منابع مشابه
Session Types as Generic Process Types
Behavioural type systems ensure more than the usual safety guarantees of static analysis. They are based on the idea of “types-as-processes”, providing dedicated type algebras for particular properties, ranging from protocol compatibility to race-freedom, lock-freedom, or even responsiveness. Two successful, although rather different, approaches, are session types and process types. The former ...
متن کاملSession Types = Intersection Types + Union Types
We propose a semantically grounded theory of session types which relies on intersection and union types. We argue that intersection and union types are natural candidates for modeling branching points in session types and we show that the resulting theory overcomes some important defects of related behavioral theories. In particular, intersections and unions provide a native solution to the pro...
متن کاملThe Expressiveness of Generic Process Shape Types
META✶ is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the π-calculus, the system of Mobile Ambients, and many of their variants. POLY✶ is a generic type system that makes a sound type system with principal types and a type inference algorithm for any instantiation of META✶. POLY✶ provi...
متن کاملExpressiveness of Generic Process Shape Types
Shape types are a general concept of process types which work for many process calculi. We extend the previously published Poly✶ system of shape types to support name restriction. We evaluate the expressiveness of the extended system by showing that shape types are more expressive than an implicitly typed π-calculus and an explicitly typed Mobile Ambients. We demonstrate that the extended syste...
متن کاملSession Types as Intuitionistic Linear Propositions
Several type disciplines for π-calculi have been proposed in which linearity plays a key role, even if their preciserelationship with pure linear logic is still not well understood. In this paper, we introduce a type system for the π-calculus that exactly corresponds to the standard sequent calculus proof system for dual intuitionistic linear logic. Ourtype system is based on a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.160.9