What is a `Good' Encoding of Guarded Choice? (1997)

Cached

Download Links

by Uwe Nestmann
Venue:INFORMATION AND COMPUTATION
Citations:64 - 2 self

Active Bibliography

88 On Asynchrony in Name-Passing Calculi – Massimo Merro, Davide Sangiorgi - 1998
4 Mobile processes: A commented bibliography – Silvano Dal Zilio - 2000
50 Bisimulations in the join-calculus – Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy - 1998
97 Decoding Choice Encodings – Uwe Nestmann, Benjamin C. Pierce - 1999
5 Locality and Polyadicity in Asynchronous Name-Passing Calculi – Massimo Merro - 2000
5 Description and Verification of Mobile Processes with Graph Rewriting Techniques – Barbara König
13 Minimality and Separation Results on Asynchronous Mobile Processes - Representability Theorems by Concurrent Combinators (Extended Abstract) – Nobuko Yoshida - 1998
17 On the relative expressive power of asynchronous communication primitives – Daniele Gorla - 2006
9 Typing Confluence – Uwe Nestmann , Martin Steffen - 1997
21 Solos in concert – Cosimo Laneve, Björn Victor - 1999
1 Welcome to the Jungle A subjective guide to mobile process calculi – Uwe Nestmann
Mobility and Modularity: expressing π-calculus in CCS (Extended Abstract) – Richard Banach, Franck van Breugel
1 Interpreting functions as π-calculus processes: a tutorial – Davide Sangiorgi - 1999
13 Asynchronous process calculi: the first-order and higher-order paradigms (Tutorial) – Davide Sangiorgi - 1999
Towards a Unified Approach to Encodability and Separation Results for Process Calculi – Daniele Gorla A
56 The Join Calculus: A Language for Distributed Mobile Programming – Cedric Fournet, Georges Gonthier - 2000
8 Reduction Semantics for Ambient Calculi – Maria Grazia Vigliotti - 2004
136 Linearity and the Pi-Calculus – Naoki Kobayashi, Benjamin C. Pierce, David N. Turner - 1999
Contents – Daniele Gorla