A theory of bisimulation for a fragment of concurrent ML with local names

A theory of bisimulation for a fragment of concurrent ML with local names (2003)

Cached

Download Links

by Alan Jeffrey , Julian Rathke

Citations:

BibTeX

@MISC{Jeffrey03atheory,
    author = {Alan Jeffrey and Julian Rathke},
    title = {A theory of bisimulation for a fragment of concurrent ML with local names},
    year = {2003}
}

Bookmark

OpenURL

Abstract

Citations

1224	A calculus of communicating systems - Milner - 1980
933	D.: A calculus of mobile processes - Milner, Parrow, et al. - 1992
725	Mobile ambients - Cardelli, Gordon - 1998
652	Notions of computation and monads - Moggi - 1991
597	Concurrency and automata on infinite sequences - Park - 1981
520	Communicating and mobile systems: the π-calculus - Milner - 1999
341	An object calculus for asynchronous communication - Honda, Tokoro - 1991
250	A calculus of mobile agents - Fournet, Gonthier, et al. - 1996
238	Expressing Mobility in Process Algebras: First-Order and HigerOrder Paradigms - Sangiorgi - 1992
192	D.: Barbed bisimulation - Milner, Sangiorgi - 1992
123	On reduction-based process semantics - Honda, Tokoro - 1995
121	Higher-order concurrency - Reppy - 1992
110	Deriving bisimulation congruences for reactive systems - Leifer, Milner - 2000
109	Bisimilarity as a theory of functional programming - Gordon
105	Observable properties of higher order functions that dynamically create local names, or: What’s new - Pitts, Stark - 1993
99	Operational reasoning for functions with local state - Pitts, Stark - 1998
92	Equality in lazy computation systems - Howe - 1989
83	G.: The reflexive CHAM and the Join-calculus - Fournet, Gonthier - 1996
80	A semantics for ML concurrency primitives - Berry, Milner, et al. - 1992
77	Hankin A Concurrent Object Calculus: Reduction and Typing - Gordon, D - 1998
75	A typed language for distributed mobile processes (extended abstract - Riely, Hennessy - 1998
65	From rewrite rules to bisimulation congruences - Sewell - 1998
62	The -calculus in Direct Style - Boudol - 1997
59	Global/local subtyping and capability inference for a distributed pi-calculus - Sewell - 1998
53	A hierarchy of equivalences for asynchronous calculi - Fournet, Gonthier
47	The problem of “Weak Bisimulation up to - Sangiorgi, Milner - 1992
42	Asynchrony and the π-calculus - Boudol - 1992
38	A Theory of Weak Bisimulation for Core CML - Ferreira, Hennessy, et al. - 1995
34	A fully abstract may testing semantics for concurrent objects - Jeffrey, Rathke - 2005
31	The re exive CHAM and the join-calculus - Fournet, Gonthier - 1996
25	A Calculus of Higher-order Communicating Systems - Thomsen - 1989
22	Towards a theory of bisimulation for local names - Jeffrey, Rathke - 1999
8	Communicating and Mobile Systems: the p-calculus - Milner - 1999
5	Operational semantics of a focussing debugger - Bernstein, Stark - 1995
5	Asynchrony and the p-calculus - Boudol - 1992
4	A concurrent object calculus - Gordon, Hankin - 1998
1	Towards a theory of bisimilarity for local names - Jeffrey, Rathke - 2000