A Theory of Weak Bisimulation for Core CML (1993)

Cached

Download Links

by William Ferreira , Matthew Hennessy , Alan Jeffrey
Venue:J. Functional Programming
Citations:38 - 7 self

Documents Related by Co-Citation

2970 Communication and Concurrency – R Milner - 1989
238 Expressing Mobility in Process Algebras: First-Order and HigerOrder Paradigms – D Sangiorgi - 1992
109 Bisimilarity as a theory of functional programming – Andrew Gordon
218 The Lazy Lambda Calculus – Samson Abramsky - 1990
102 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
92 Equality In Lazy Computation Systems – Douglas J. Howe - 1998
238 Pict: A programming language based on the pi-calculus – Benjamin C. Pierce, David N. Turner - 1997
933 Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
123 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
1497 The Definition of Standard ML – R Milner, M Tofte, R Harper - 1990
121 Higher-order Concurrency – John Hamilton Reppy - 1992
725 Mobile ambients – Luca Cardelli, Andrew D. Gordon - 1998
228 Typing and Subtyping for Mobile Processes – Benjamin Pierce , Davide Sangiorgi - 1996
18 Contextual equivalence for higher-order pi-calculus revisited – A Jeffrey, J Rathke
8 A calculus of mobile proceses – R Milner, J Parrow, D Walker - 1992
520 Communicating and mobile systems: the π-calculus – R Milner - 1999
374 Algebraic theory of processes – M Hennessy - 1988
192 Barbed Bisimulation – Robin Milner, Davide Sangiorgi, Edinburgh Eh Jz - 1992
290 Functions as processes – R Milner - 1992