A generic type system for the Pi-calculus
نویسندگان
چکیده
منابع مشابه
A generic model of the pi calculus
We present a generic model of the -calculus based on a new mathematical structure called -forests. We present a small theory of the static properties of -forests, with a short study of homomorphisms. We then present the dynamic aspects of the model by encoding the -calculus. Finally we consider an example using the model, which uses a general -calculus result that relates languages with process...
متن کاملThe Expressiveness of Poly✶, a Generic Process Calculus Type System
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✶. This paper ...
متن کاملProof System for Applied Pi Calculus
A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it ...
متن کاملA Type System for proving Depth Boundedness in the pi-calculus
The depth-bounded fragment of the π-calculus is an expressive class of systems enjoying decidability of some important verification problems. Unfortunately membership of the fragment is undecidable. We propose a novel type system, parameterised over a finite forest, that formalises name usage by π-terms in a manner that respects the forest. Type checking is decidable and type inference is compu...
متن کاملA Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational semantics. A pi-chart is a finite directed acyclic graph recording a computation in the pi-calculus. Each node represents a process, and each edge either represents a computation step, or a message-passing interaction. P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00325-6