Fournet, C. and G. Gonthier, The reflexive CHAM and the join-calculus, in: Proc. POPL'96 (1996), pp. 372--385.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....work we can orient each graph by requiring every edge to contain say exactly one positive port. For example, if the left port of the control in Example 2 is declared positive in the signature, then every message is addressed to a unique receiver. This is true for example in the Join calculus [8], but not in the calculus, where it is an important source of non determinism. Thus the orientation of graphs has significant practical implications. The WRS functor in this case is the obvious forgetful functor from signed BRSs to Big a . It is not an inclusion, so we do not have a sub BRS. ....

Fournet, C. and Gonthier, G. (1996), The reflexive Cham and the join calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, Florida, pp372--385.

.... # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # 1 5 4 2 # ## # # # L open a a open a open Foundations # calculus [MPW92] very basic wrtWAN) Klaim [DFP98, DFPV00, BLP02] Ambient [CG00] D# [HR98, HR00] Djoin [FG96, FGL 96] Seal [VC98] # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # ....

Cedric Fournet and George Gonthier. The reflexive CHAM and the join-calculus. In Conference Record of POPL '96: The 23 rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 372--385, St. Petersburg Beach, Florida, January 1996.

....studied the influence of regarding finite computations as atomic events on concurrent languages semantics, yet it seems that polyadic synchronisation is not expressible in their framework. Nestmann [23] has studied the expressive power of the joint input, a liberalisation of the join patterns of [14], in the # calculus framework: it can be seen as a form of biadic synchronisation for input processes only . For the lack of a corresponding biadic output, it does not provide a solution to the matching problem. Abadi and Gordon (Appendix A of [1] mentioned synchronisation on tuples to point ....

Fournet, C. and G. Gonthier, The reflexive CHAM and the join-calculus, in: Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (1996), pp. 372--385.

....for output u hviP , input u (X ) Q , mis)matching if u = v then Q else R and iteration P (in the literature, iteration is often written P ) Communication between agents occurs along channels. As discussed in the example at the beginning of this section, communication is purely local (unlike [3, 12, 29]) in that agents can only communicate with other agents at the same location, using channels that have been allocated at that location. In the concrete syntax, go has greater binding power than composition. Thus go : P j Q should be read (go : P) j Q . We adopt several standard abbreviations. ....

C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. In Conference Record of the ACM Symposium on Principles of Programming Languages, Paris, January 1996. ACM Press.

....the interaction of objects when an object calls the method of another uniquely determined object. The l1 calculus further enriches the 1 calculus by adding explicit locations, failures, mobility of processes and failure detectors. 3.2. 2 Join Calculus The join calculus by Fournet and Gonthier [33, 34] can be considered as a variant of the asynchronous calculus which focuses on better locality and static scoping principles. It is viable for a realistic distributed implementation as it avoids global consensus for communication. In the join calculus syntactic restrictions ensure that all ....

....It is viable for a realistic distributed implementation as it avoids global consensus for communication. In the join calculus syntactic restrictions ensure that all channels have a unique location. It is assumed that the underlying network knows the location of every channel. The conceptual model [33] was obtained by an extension of the generic model of the chemical abstract machine [35] In a later work the join calculus was extended with explicit locations and primitives for mobility [34] The resulting Distributed join calculus allows the expression of mobile agents moving between different ....

[Article contains additional citation context not shown here]

C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. In Proceedings 23rd ACM Symposium on Principles of Programming Languages (POPL '96), pages 372--385, Florida, Jan 1996. ACM.

....protocol. 3. Protocol formalization Our protocol specification language is an elaboration of the Gamma formalism [2, 3] Gamma is based on multiset rewriting (also called the chemical reaction paradigm ) which has already been used in various contexts to reason about distributed computations [7, 8, 13]. The Gamma formalism is based on the chemical reaction metaphor. The unique data structure in Gamma [2] is the multiset (a set than can contain several occurrences of the same element) which can be seen as a chemical solution . A simple program is a set of rules Reaction condition Action. ....

C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. In ACM, editor, Conference record of POPL '96, 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the Symposium: St. Petersburg Beach, Florida, 21--24 January 1996, pages 372--385, New York, NY, USA, 1996. ACM Press.

....fusion should be used wherever it can be used. Method fusion, on the other hand, can be applied to programs in which static fusion cannot be applied. If both techniques are combined, the performance of parallel programs will be greatly improved. Join calculus and multi functions. Join calculus [FG96] expresses program execution as a sequence of synchronizations between messages, which replaces multiple function calls with another code fragment. The semantics of synchronization are similar to those of method fusion, and the API for describ107 ing the specification of synchronization (join ....

C'edric Fournet and Georges Gonthier. The Reflexive CHAM and the Join Calculus. In Proceedings of the 23rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages (POPL '96), pages 372--385, St. Petersburg Beach, FL USA, January 1996.

....new communication channels to be created dynamically, and for their scope to be controlled in the style 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 characterization of program equivalence for the l calculus together with p style concurrency. The full ....

C. Fournet and G. Gonthier. The reflexive CHAM and the joincalculus. In Proc. POPL, 1996.

....on a named channel may be transmitted. The calculus fragment defined by these restrictions, also known as the local calculus (Merro and Sangiorgi 1998) has a richer equational theory than the full calculus, and can be regarded as a basis for some proposals of concurrent programming languages (Fournet and Gonthier 1996; Pierce and Turner 1997) The additional algebraic laws obtained in the local variant of , such as, for example, the replication laws listed subsequently in Proposition A.8, are required in the proof of Theorem 5.2, the correctness of our proposed equational theory for the region calculus. The ....

Fournet, C. and G. Gonthier (1996). The reflexive CHAM and the Joincalculus.

.... Sewell proposes a type system to distinguish between these, where channels either have universal reach or are restricted to a single local area [14] The Join calculus requires all channels to be located: while anyone may transmit data, only a chosen process at a single site can receive it [5]. Sangiorgi s notion of uniform receptiveness is similar [12] The use of types to structure the expected use of calculus channels is well established: the survey paper by Sangiorgi [13] gives a good overview. 2 A calculus of local areas 2.1 Syntax The calculus is built around two classes ....

C. Fournet and G. Gonthier. The reflexive CHAM and the join-calculus. In Conference Record of POPL '96: 23rd ACM Symposium on Principles of Programming Languages, pages 372--385. ACM Press, 1996.

....but equivalent characterisations of our operational semantics. Various formalisms in the calculus family have been used to model imperative or concurrent objects, for instance, in the work of Honda and Tokoro (1991) Jones (1993) Vasconcelos (1994) Pierce and Turner (1995) Walker (1995) Fournet and Gonthier (1996), Kleist and Sangiorgi (1997) and Dal Zilio (1998) All these models use formalisms based on processes, computations with no concept of returning a result, instead of expressions. The operation of returning a result is translated using continuations into sending a message on a result channel. Our ....

Fournet, C. and G. Gonthier (1996). The reflexive CHAM and the Join-calculus. In Proc. POPL'96, pp. 372--385.

No context found.

Fournet, C. and G. Gonthier, The reflexive CHAM and the join-calculus, in: Proc. POPL'96 (1996), pp. 372--385.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the Join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372--385. ACM Press, 1996.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In Proceedings of the 23rd POPL, pages 372--385. ACM press, January 1996.

No context found.

C'edric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In Proceedings of the 23rd POPL, pages 372--385. ACM press, January 1996.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the Join-calculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372--385. ACM Press, 1996.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the joincalculus. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages, pages 372--385. ACM Press, 1996.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In POPL 1996 [27], pages 372--385.

No context found.

Fournet, C. and Gonthier, G. (1996), The reflexive Cham and the join calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, Florida, pp372--385.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the joincalculus. In Conference Record of POPL '96: 23rd ACM Symposium on Principles of Programming Languages, pages 372--385. ACM Press, 1996.

No context found.

C'edric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 372--385, 1996.

No context found.

Fournet, C. and Gonthier, G. (1996), The reflexive Cham and the join calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, Florida, pp372--385.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In POPL 1996 [28], pages 372--385.

No context found.

Fournet, C. and Gonthier, G. (1996), The reflexive Cham and the join calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, Florida, pp372--385.

No context found.

Cedric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In POPL 1996 [14], pages 372--385.

First 50 documents

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