Towards a Theory of Bisimulation for Local Names (1999)

Cached

Download Links

by Alan Jeffrey , Julian Rathke
Venue:In 14th Annual Symposium on Logic in Computer Science
Citations:23 - 1 self

Documents Related by Co-Citation

783 A calculus for cryptographic protocols: The spi calculus – Martin Abadi, Andrew D. Gordon - 1999
119 On the Observable Properties of Higher Order Functions that Dynamically Create Local Names (preliminary report) – Andrew Pitts, Ian Stark - 1993
814 Mobile ambients – Luca Cardelli, Andrew D. Gordon - 1998
55 Names and Higher-Order Functions – I D B Stark - 1994
1290 A Structural Approach to Operational Semantics – G. D. Plotkin - 1981
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
71 From Rewrite Rules to Bisimulation Congruences – Peter Sewell - 1998
62 Global/local subtyping and capability inference for a distributed π-calculus – Peter Sewell - 1998
224 Barbed Bisimulation – Robin Milner, Davide Sangiorgi, Edinburgh Eh Jz - 1992
134 Towards a Mathematical Operational Semantics – Daniele Turi, Gordon Plotkin - 1997
315 Functions as processes – R Milner - 1990
189 A Calculus of Mobile Processes, Part I – Robin Milner, Joachim Parrow, David Walker - 1989
17 Bisimulations for Untyped Imperative Objects – V Koutavas, M Wand - 2006
39 Categorical Models for Local Names – Ian Stark - 1996
111 Operational Reasoning for Functions With Local State – Andrew Pitts, Ian Stark
442 The π-calculus: A Theory of Mobile Processes – Davide Sangiorgi, David Walker - 2001
271 A Calculus of Mobile Agents – Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, Didier Rémy, Inria Rocquencourt - 1996
15 An algebra of graphs and graph rewriting – A CORRADINI, U MONTANARI - 1991
150 Elements of Interaction – Robin Milner - 1993