A. Je#rey and J. Rathke. Towards a theory of bisimulation for local names. In 14th Annual Symposium on Logic in Computer Science, 2--5 July, 1999, Trento, Italy, pages 56--66. IEEE Press, 1999.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... of the work presented here lies in the calculus , a fragment of ML [MTHM97] introduced by the second author and Stark [PiS93a, Sta95] to explore the properties, with respect to semantic equivalence of programs, of call by value higher order functions and dynamically created names (see also [JeR99]) In [Sta96a] Stark studies a model of the calculus based on one of Moggi s dynamic allocation monads [Mog89] in the presheaf category Set , where I is the category of nite ordinals and injective functions between them. Crucial ingredients of the dynamic allocation monad used there are ....

Jerey, A. and Rathke, J.: Towards a theory of bisimulation for local names. In 14th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, Washington, DC, 1999, , pp. 56-66.

....In this section, we present a simply typed calculus with lazy operational semantics. Usually, strategies on calculus (and corresponding observational equivalences) are de ned in terms of reduction systems [3, 1] Here we give an alternative presentation based on a lts inspired by [20] (where a call by value typed calculus is considered) we de ne a lts on closed terms with weak bisimilarity yielding observational (contextual) equivalence [1] For simplicitly and for lack of space, we consider a very small language whose syntax of types Type and terms is de ned as ....

Jerey, A. and J. Rathke, Towards a theory of bisimulation for local names, in: Proc. LICS

....In this section, we present a simply typed # calculus with lazy operational semantics. Usually, strategies on # calculus (and corresponding observational equivalences) are defined in terms of reduction systems [3, 1] Here we give an alternative presentation based on a lts inspired by [19] (where a call by value typed # calculus is considered) we define a lts on closed # terms with weak bisimilarity yielding observational (contextual) equivalence [1] For simplicitly and for lack of space, we consider a very small language whose syntax of types Type and terms # is defined as ....

Je#rey, A. and J. Rathke, Towards a theory of bisimulation for local names, in: Proc. LICS

....technical results in this paper to do with operational properties of ML functions with local references are covered in more detail in the paper [15] written jointly with Ian Stark. More recent work on this topic includes the use of labelled transition systems and bisimulations by Je#rey and Rathke [7]; and the use by Aboul Hosn and Hannan of static restric I will use the concrete syntax of Caml. Andrew M. Pitts tions on local state in functions to give a more tractable theory of equivalence [1] The use of logical relations based on abstract machine semantics to analyse other programming ....

A. Je#rey and J. Rathke. Towards a theory of bisimulation for local names. In 14th Annual Symposium on Logic in Computer Science, pages 56--66. IEEE Computer Society Press, Washington, 1999.

....to include namegeneration as in Milner s calculus. The calculus already has a presheaf semantics [6] but it has not been extended to higher order (see [22] for an operational extension) We hope to be able to link up with the work on the calculus by Pitts and Stark [20] and Je rey and Rathke [12]. Acknowledgments. We thank the encyclopaedic Andy Pitts for helpful advice. Part of this paper was prepared during a pleasant visit of MN to DISI the people there are thanked for their hospitality. ....

A. Jerey and J. Rathke. Towards a theory of bisimulation for local names. In Proc. LICS'99.

....quantification over all contexts. Work by Fournet [Fou98] and by Fournet and Gonthier [FG98] ease this burden with techniques that allow a proof of barbed congruence to be broken into pieces, each of which may be carried out using other congruence relations. 1.5. Other work 15 Je#rey and Rathke [JR99] used contexts as the basis for the labels of an LTS in the case of the # calculus (a variant of the # calculus with fresh name creation) They did not derive uniformly these labels from a reaction relation but they were guided by the intuition that the labels are small contexts that enable a ....

A. Je#rey and J. Rathke. Towards a theory of bisimulation for local names. In 14th Annual Symposium on Logic in Computer Science, 2--5 July,

.... of the work presented here lies in the calculus , a fragment of ML [MTHM97] introduced by the second author and Stark [PS93a, Sta95] to explore the properties, with respect to semantic equivalence of programs, of callby value higher order functions and dynamically created names (see also [JR99]) In [Sta96a] Stark studies a model of the calculus based on one of Moggi s dynamic allocation monads [Mog89] in the presheaf category Set I , where I is the category of nite ordinals and injective functions between them. Crucial ingredients of the dynamic allocation monad used there are ....

A. Jerey and J. Rathke. Towards a theory of bisimulation for local names. In 14th Annual Symposium on Logic in Computer Science, pages 56-66. IEEE Computer Society Press, Washington, 1999.

....(compared with analogous examples in other formalisms) as a good sign 6. Relation to presheaf models One origin of the work presented here lies in the calculus , a calculus of higher order functions and dynamically created names introduced by the second author and Stark [32, 36] see also [17]) In [37] Stark studies a model of the calculus based on one of Moggi s dynamic allocation monads [29] in the presheaf category Set I , where I is the category of finite ordinals and injective functions between them. Crucial ingredients of the dynamic allocation monad used there are the ....

A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In this volume.

....and congruence proofs need to be checked to see how close our uniformly derived LTSs and equivalences come to theirs. We would like to study in generality the situation in which redexes themselves are contexts, as Sewell [22] has done for term rewriting with parallel composition. Je rey and Rathke [13] have recently studied the relationship between contextual equivalence and labelled transitions for the calculus of Pitts and Stark [20] this will provide a good test for our uniform derivation of LTSs. We do not expect yet to achieve the ne tuning present in some calculi; but we see no ....

Jerey, A. and Rathke, J., Towards a theory of bisimulation for local names. Proc. LICS'99, IEEE Press, pp. 56-66, 1999.

....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 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 establishing congruence of bisimulation differ greatly. In the previous paper we utilized a variant ....

....semantics for nCML and a coinductive presentation of barbed equivalence based on this. 3 Operational semantics and bisimulation equivalence We make our first steps towards characterizing barbed equivalence using a labelled 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 ....

[Article contains additional citation context not shown here]

A.S.A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. In Proc. LICS, pages 56--66. IEEE Computer Society Press, 1999.

No context found.

A. Je#rey and J. Rathke. Towards a theory of bisimulation for local names. In 14th Annual Symposium on Logic in Computer Science, 2--5 July, 1999, Trento, Italy, pages 56--66. IEEE Press, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC