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

### Cached

### Download Links

Citations: | 19 - 2 self |

### 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}

}

### OpenURL

### Abstract

### Citations

1329 |
A calculus of communicating systems
- Milner
- 1980
(Show Context)
Citation Context ...el 0 semantics. Define: R D = (nk : C 1 kC;nk : C 2 kC) j D;k C 1 C 2 and show that R is a bisimulation. In order simplify this we use an up to technique involving strong bisimulation equivalence [16=-=,-=- 20]. In fact we show that R is a bisimulation up to ( b ! ;) where denotes strong bisimulation. The reader is invited to check that this is a valid proof technique because confluence implies commut... |

995 | A calculus of mobile processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ..., higher-order functions, bisimulation, local names 1 Introduction Reppy's [23] Concurrent ML is an extension of Standard ML [25] with concurrency primitives based on Milner's CCS [16] and p-calculus =-=[17, 18]-=-. Reppy [23] and Berry, Milner and Turner [2] provided CML with a reduction semantics, based on the SML language definition [25]. This semantics allows proofs of many important properties such as subj... |

809 | Mobile Ambients
- Cardelli, Gordon
- 1998
(Show Context)
Citation Context ...imply typed l-calculus rules) ; D;n : sthread ` t : s D;n : sthread ` n[t] D ` 0 D `C 1 D `C 2 D `C 1 kC 2 D;n : s `C D ` nn : s : C Figure 2: Configuration type inference rules Cardelli and Gordon's =-=[5]-=- ambients, where the ambient tree is flat and names are used linearly. The authors made initial steps towards the current labelled transition semantics for local names in [15]. We proposed there a nov... |

732 | Notions of computation and monads - Moggi - 1991 |

655 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ...el 0 semantics. Define: R D = (nk : C 1 kC;nk : C 2 kC) j D;k C 1 C 2 and show that R is a bisimulation. In order simplify this we use an up to technique involving strong bisimulation equivalence [16=-=,-=- 20]. In fact we show that R is a bisimulation up to ( b ! ;) where denotes strong bisimulation. The reader is invited to check that this is a valid proof technique because confluence implies commut... |

587 |
Communicating and Mobile Systems: the π-Calculus
- Milner
- 1999
(Show Context)
Citation Context ..., higher-order functions, bisimulation, local names 1 Introduction Reppy’s [23] Concurrent ML is an extension of Standard ML [25] with concurrency primitives based on Milner’s CCS [16] and π-calculus =-=[17, 18]-=-. Reppy [23] and Berry, Milner and Turner [2] provided CML with a reduction semantics, based on the SML language definition [25]. This semantics allows proofs of many important properties such as subj... |

361 | An object calculus for asynchronous communication
- Honda, Tokoro
- 1991
(Show Context)
Citation Context ... = joinn 0 infalse]: However, it is not observable in this language whether a thread is currently waiting on another to terminate. This bears similarity to the situation of the asynchronous pcalculus =-=[3, 12]-=- and the transitions we use are akin to those for input receptivity [12]. The use of the free name context allows us to model the static scoping discipline present in CML. The transition rules we use ... |

267 | A calculus of mobile agents
- Fournet, Gonthier, et al.
(Show Context)
Citation Context ...tyle of the p-calculus. Much of the power of CML rests on channel generation, for example it is used in Reppy's coding of recursion into l cv . Many languages, such as Fournet et al.'s join calculus, =-=[7, 9]-=- Boudol's blue calculus [4], Thomsen's CHOCS [30] and Sangiorgi's higher-order p-calculus [26] include encodings of the l-calculus using unique names. This paper provides the first direct characteriza... |

258 |
Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms
- Sangiorgi
- 1992
(Show Context)
Citation Context ...used in Reppy's coding of recursion into l cv . Many languages, such as Fournet et al.'s join calculus, [7, 9] Boudol's blue calculus [4], Thomsen's CHOCS [30] and Sangiorgi's higher-order p-calculus =-=[26]-=- include encodings of the l-calculus using unique names. This paper provides the first direct characterization of program equivalence for the l-calculus together with p-style concurrency. The full lan... |

219 | Barbed bisimulation, in
- Milner, Sangiorgi
- 1992
(Show Context)
Citation Context ...losure of !. 2.1 Observational equivalence, b We present a notion of observational equivalence for our language following [13], which is a variant of the barbed bisimulation equivalence proposed in [=-=19]-=-. The interested reader can see [8] for a discussion regarding the two approaches. A binary relation R on configurations is contextual if it satisfies: C 1 R C 2 implies 8C : C [C 1 ] R C [C 2 ] R is ... |

139 | On reduction-based process semantics
- Honda, Yoshida
- 1995
(Show Context)
Citation Context ...confluent communication rule C t - C 0 . Let ) be the reflexive transitive closure of !. 2.1 Observational equivalence, b We present a notion of observational equivalence for our language following [=-=13]-=-, which is a variant of the barbed bisimulation equivalence proposed in [19]. The interested reader can see [8] for a discussion regarding the two approaches. A binary relation R on configurations is ... |

125 | Higher–Order Concurrency
- Reppy
- 1992
(Show Context)
Citation Context ...ariant of Sangiorgi's normal bisimulation for nCML, and show that this too coincides with bisimulation. Keywords: concurrency, higher-order functions, bisimulation, local names 1 Introduction Reppy's =-=[23]-=- Concurrent ML is an extension of Standard ML [25] with concurrency primitives based on Milner's CCS [16] and p-calculus [17, 18]. Reppy [23] and Berry, Milner and Turner [2] provided CML with a reduc... |

120 |
Bisimilarity as a theory of functional programming
- Gordon
- 1995
(Show Context)
Citation Context ... the current setting; however, the proof techniques for establishing congruence of bisimulation differ greatly. In the previous paper we utilized a variant of a proof technique known as Howe's method =-=[14, 10]-=-. Unfortunately, this is not available to us here and, instead we adapt Sangiorgi's [26] trigger semantics from the higher-order p-calculus. The approach we develop here generalizes the trigger encodi... |

118 | Observable properties of higher order functions that dynamically create local names, or What’s new
- Pitts, Stark
- 1993
(Show Context)
Citation Context ...e task of showing that bisimulation is a congruence. This is a notoriously difficult problem, and proof techniques which work in the presence of both higherorder features and unique names are limited =-=[21, 22]-=-. A viable approach to tackling this problem in languages with sufficient power is to represent higher-order computation by first-order means. Indeed, Sangiorgi demonstrates in his thesis [26] that hi... |

116 | R.: Deriving bisimulation congruences for reactive systems - Leifer, Milner |

110 | Operational reasoning in functions with local state
- Pitts, Stark
- 1998
(Show Context)
Citation Context ...e task of showing that bisimulation is a congruence. This is a notoriously difficult problem, and proof techniques which work in the presence of both higherorder features and unique names are limited =-=[21, 22]-=-. A viable approach to tackling this problem in languages with sufficient power is to represent higher-order computation by first-order means. Indeed, Sangiorgi demonstrates in his thesis [26] that hi... |

100 | The reflexive cham and the join-calculus - Fournet, Gonthier - 1996 |

95 | Equality in lazy computation systems
- Howe
- 1989
(Show Context)
Citation Context ... the current setting; however, the proof techniques for establishing congruence of bisimulation differ greatly. In the previous paper we utilized a variant of a proof technique known as Howe's method =-=[14, 10]-=-. Unfortunately, this is not available to us here and, instead we adapt Sangiorgi's [26] trigger semantics from the higher-order p-calculus. The approach we develop here generalizes the trigger encodi... |

81 | A semantics for ML concurrency primitives
- Berry, Milner, et al.
- 1992
(Show Context)
Citation Context ...s 1 Introduction Reppy's [23] Concurrent ML is an extension of Standard ML [25] with concurrency primitives based on Milner's CCS [16] and p-calculus [17, 18]. Reppy [23] and Berry, Milner and Turner =-=[2]-=- provided CML with a reduction semantics, based on the SML language definition [25]. This semantics allows proofs of many important properties such as subject reduction, but does not directly support ... |

79 | A Concurrent Object Calculus: Reduction and Typing
- Gordon, Hankin
- 1998
(Show Context)
Citation Context ...ecause they help simplify the lts semantics. This use of thread identifiers is similar to the use of function definitions in Fournet et al.'s join calculus, and object pointers in Gordon and Hankin's =-=[11]-=- concurrent object calculus, but with the important difference that thread identifiers can contain actively executing code rather than just functions or objects. They can also be seen as a restricted ... |

77 | A typed language for distributed mobile processes
- Riely, Hennessy
- 1998
(Show Context)
Citation Context ...mechanism. We have also identified a useful `bisimulation up to' technique based on confluent reduction. There is a striking relationship between location based mobile agent languages in the sense of =-=[5, 24, 29]-=- and the thread identifiers. It could be fruitful to adapt the techniques used here to such a setting. In particular, trigger encodings could address the issues of migrating processes and scope in muc... |

71 | From rewrite rules to bisimulation congruences
- Sewell
- 1998
(Show Context)
Citation Context ...textual in the sense that each labelled transition represents a small program fragment which induces an appropriate reduction. This notion of contextual label has been investigated in depth by Sewell =-=[28]-=-. Our labelled transition system is defined as a relation between well-typed configurations. The rules are presented in Figure 5. In addition to these transitions with labels ranged over by g, we incl... |

64 | The π-calculus in direct style
- Boudol
- 1998
(Show Context)
Citation Context ...f the power of CML rests on channel generation, for example it is used in Reppy's coding of recursion into l cv . Many languages, such as Fournet et al.'s join calculus, [7, 9] Boudol's blue calculus =-=[4]-=-, Thomsen's CHOCS [30] and Sangiorgi's higher-order p-calculus [26] include encodings of the l-calculus using unique names. This paper provides the first direct characterization of program equivalence... |

62 | Global/local subtyping and capability inference for a distributed - calculus
- Sewell
- 1998
(Show Context)
Citation Context ...mechanism. We have also identified a useful `bisimulation up to' technique based on confluent reduction. There is a striking relationship between location based mobile agent languages in the sense of =-=[5, 24, 29]-=- and the thread identifiers. It could be fruitful to adapt the techniques used here to such a setting. In particular, trigger encodings could address the issues of migrating processes and scope in muc... |

58 | A hierarchy of equivalences for asynchronous calculi
- Fournet, Gonthier
- 2005
(Show Context)
Citation Context ...alence, b We present a notion of observational equivalence for our language following [13], which is a variant of the barbed bisimulation equivalence proposed in [19]. The interested reader can see [=-=8]-=- for a discussion regarding the two approaches. A binary relation R on configurations is contextual if it satisfies: C 1 R C 2 implies 8C : C [C 1 ] R C [C 2 ] R is barbed if it satisfies: C 1 R C 2 i... |

50 | Techniques of “weak bisimulation up to - Sangiorgi, Milner - 1992 |

45 |
Asynchrony and the π-calculus
- Boudol
- 1992
(Show Context)
Citation Context ...£ ��§ ¨ £ ¢s� � � ¢� However, it is not observable in this language whether a thread is currently waiting on another to terminate. This bears similarity to the situation of the asynchronous πcalculus =-=[3, 12]-=- and the transitions we use are akin to those for input receptivity [12]. The use of the free name context allows us to model the static scoping discipline present in CML. The transition rules we use ... |

39 | A theory of weak bisimulation for core CML
- Ferreira, Hennessy, et al.
- 1998
(Show Context)
Citation Context ...ant properties such as subject reduction, but does not directly support a notion of program equivalence, which is important for rewrites such as compiler optimizations. Ferreira, Hennessy and Jeffrey =-=[6]-=- provided a labelled transition system semantics for a fragment of CML, and showed that the resulting theory of bisimulation was a congruence, and could therefore be used to justify equational rewriti... |

38 | A fully abstract may testing semantics for concurrent objects - Jeffrey, Rathke - 2005 |

31 |
The re exive CHAM and the join-calculus
- Fournet, Gonthier
- 1996
(Show Context)
Citation Context ...tyle of the p-calculus. Much of the power of CML rests on channel generation, for example it is used in Reppy's coding of recursion into l cv . Many languages, such as Fournet et al.'s join calculus, =-=[7, 9]-=- Boudol's blue calculus [4], Thomsen's CHOCS [30] and Sangiorgi's higher-order p-calculus [26] include encodings of the l-calculus using unique names. This paper provides the first direct characteriza... |

25 |
Calculi for Higher-Order Communicating Systems
- Thomsen
- 1990
(Show Context)
Citation Context ...sts on channel generation, for example it is used in Reppy's coding of recursion into l cv . Many languages, such as Fournet et al.'s join calculus, [7, 9] Boudol's blue calculus [4], Thomsen's CHOCS =-=[30]-=- and Sangiorgi's higher-order p-calculus [26] include encodings of the l-calculus using unique names. This paper provides the first direct characterization of program equivalence for the l-calculus to... |

23 | Towards a theory of bisimulation for local names
- Jeffrey, Rathke
- 1999
(Show Context)
Citation Context ...les Cardelli and Gordon's [5] ambients, where the ambient tree is flat and names are used linearly. The authors made initial steps towards the current labelled transition semantics for local names in =-=[15]-=-. We proposed there a novel transition system which incorporated a notion of privacy. We adopt the same technique for modelling local names in the current setting; however, the proof techniques for es... |

11 |
Communicating and Mobile Systems: The p-Calculus
- Milner
- 1999
(Show Context)
Citation Context ..., higher-order functions, bisimulation, local names 1 Introduction Reppy's [23] Concurrent ML is an extension of Standard ML [25] with concurrency primitives based on Milner's CCS [16] and p-calculus =-=[17, 18]-=-. Reppy [23] and Berry, Milner and Turner [2] provided CML with a reduction semantics, based on the SML language definition [25]. This semantics allows proofs of many important properties such as subj... |

5 |
Operational semantics of a focussing debugger
- Bernstein, Stark
- 1995
(Show Context)
Citation Context ...ed transition system semantics. We adopt the approach we advocated in [15] by designing a semantics such that: Bisimulation can be defined in the standard way (following Gordon [10] and Bernstein's [=-=1-=-] approach to bisimulation for higher-order languages, rather than the higher-order bisimulation used by Thomsen [30] and Ferreira, Hennessy and Jeffrey [6]). Labels are contextual in the sense that ... |

5 |
Asynchrony and the p-calculus
- Boudol
- 1992
(Show Context)
Citation Context ... = joinn 0 infalse]: However, it is not observable in this language whether a thread is currently waiting on another to terminate. This bears similarity to the situation of the asynchronous pcalculus =-=[3, 12]-=- and the transitions we use are akin to those for input receptivity [12]. The use of the free name context allows us to model the static scoping discipline present in CML. The transition rules we use ... |

4 | A concurrent object calculus - Gordon, Hankin - 1998 |

1 | Towards a theory of bisimilarity for local names - Jeffrey, Rathke - 2000 |