| Tom Chothia and Ian Stark. Encoding Distributed Areas and Local Communication into the -calculus. In Proceedings of EXPRESS '01: Expressiveness in Concurrency, Electronic Notes in Theoretical Computer Science. Elsevier, 2001. |
.... 12 Client = #c) w#finger , c# c(x) print#x#) Server = w(s, r) s#r# finger(y) y#wUsers# daytime(z) z#wDate# System = net [host [Client ] host [Server ] Declarations = finger host , daytime host , print host , c net , w net An encoding of la# in # calculus is given in [10], but as the authors point out, it is divergent . Below we give a divergence free, uniform encoding of la# in #, and we state an operational correspondence. l 0] # = 0 (Zero) Q] # l Q] Par) l m[P ] #e) # #m P ] #,m##e e fn(P ) cod(#) ....
....# = a#b# or # = # , the following hold: i) if # =# P # then [ # =# [ # l P # ] ii) if [ # l P ] # =# Q then #P # : # =# P # and [ # l P # ] # Q; where [ # ] # = # and [ a#b#] # = e a#b# if e = #(m) and #(a) # m. Proof. Follows from Theorem 5. 1 of [10] and Theorem 3.8 of [self] # Note that the reasoning that in la# is carried out through a type system, can be expressed in # at the language level, without introducing divergence. It can be argued that a type system is indeed the appropriate tool for discerning global definitions and local ....
Chothia, T. and I. Stark, Encoding distributed areas and local communication into the pi-calculus, in: Proc. of EXPRESS'01, ENTCS 52.1 (2002).
No context found.
Tom Chothia and Ian Stark. Encoding Distributed Areas and Local Communication into the -calculus. In Proceedings of EXPRESS '01: Expressiveness in Concurrency, Electronic Notes in Theoretical Computer Science. Elsevier, 2001.
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