9 citations found. Retrieving documents...
Joachim Parrow. Trios in Concert. (Draft), July 1995.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
The Fusion Machine (Extended Abstract) - Gardner, Laneve, Wischik   (Correct)

....explains why fragmententation becomes relevant for a distributed implementation. We treat fragmentation formally by showing that a calculus with limited continuations the explicit solos calculus is as expressive as the full calculus with continuations. This builds upon earlier results in [13, 10]. The di#erences between our model and that of Facile and Jocaml are as follows. Facile uses two classes of distributed entities: co )located processes which execute, and channel managers which mediate interaction. This forces it to use a hand shake discipline for rendezvous. Jocaml simplifies ....

....continuation P would be transported first to u, then v, then x, then y. This is undesirable if the continuation P is large. There have been two encodings of the pi calculus into a limited calculus without nested continuations. These might solve the e#ciency problem. The first encoding, by Parrow [13], uses a sub calculus of the pi calculus consisting of trios so that, for instance, u(y) v y becomes t 1 (#x) u(y) t 2 xy t 2 (#xy) v y.t 3 xy. Here, triggers t 1 , t 2 , t 3 guard each input and output command, and also transport the entire environment to every continuation. An encoded ....

[Article contains additional citation context not shown here]

J. Parrow. Trios in concert. In Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 621--637. MIT Press, 2000.


New Directions in Implementing the Pi Calculus - Wischik (2002)   (Correct)

....the pure pi calculus, and we leave pre deployment as a compiletime optimisation. Note that in the case of input mobility u(x) x(y) P , the ultimate location of x(y) cannot be known until after u(x) but even so we can still pre deploy P . Other authors have proposed weaker forms of fragmentation [8, 4] but in a theoretical setting, not for implementation. Location based calculi. The dominant paradigm in the research community is not channel based but rather location based. This means: assume several locations, each containing a collection of programs with their own channels. For instance, the ....

J. Parrow. Trios in concert. In Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 621--637. MIT Press, 2000.


Decoding Choice Encodings - Nestmann, Pierce (1999)   (52 citations)  (Correct)

.... encodings within a hierarchy of # calculi with internal mobility [San96] the encoding of the choice free asynchronous # calculus into the join calculus [FG96] which may be interpreted as a fragment of the # calculus) and the translation of the choice free synchronous # cal culus into trios [Par99]. Much more work has been done on the compilation of whole languages into process calculi, exploring both semantics and expressiveness. Examples include translations between the process calculi CSP and CCS [Li83, Mil87] between the join calculus and the # calculus [FG96] of # calculi into ....

J. Parrow. Trios in Concert. In G. Plotkin, C. Stirling and M. Tofte, eds, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1999. To appear.


Decoding Choice Encodings - Nestmann, Pierce (1997)   (52 citations)  (Correct)

.... encodings within a hierarchy of calculi with internal mobility [San96] the encoding of the choice free asynchronous cal culus into the join calculus [FG96] which may be interpreted as a fragment of the calculus) and the translation of the choice free synchronous calculus into trios [Par97]. Much more work has been done on the compilation of whole languages into process calculi, exploring both semantics and expressiveness. Examples include translations between the process calculi CSP and CCS [Li83, Mil87] between the join calculus and the calcu lus [FG96] of calculi into ....

J. Parrow. Trios in Concert. In G. Plotkin, C. Stirling and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, 1997. To appear.


Solos in Concert - Laneve, Victor (1999)   (2 citations)  (Correct)

....in the calculus. Another important factor is that the calculus is polyadic: an input or output can carry arbitrarily many objects. In the strictly monadic calculus we strongly conjecture that the expressiveness of prefixes is strictly greater than that of solos. Related work: Parrow shows in [13] that in the calculus without match, any agent can be encoded as a concert of trios, i.e. a parallel composition of possibly replicated prefixes ff 1 : ff 2 : ff 3 up to weak open equivalence [18] He also shows that duos, i.e. prefixes nested to depth 2, are not sufficient. In this paper we ....

J. Parrow. Trios in concert. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, 1998. To appear.


Solo Diagrams - Laneve, Parrow, Victor (2001)   (2 citations)  Self-citation (Parrow)   (Correct)

....among edges and hinders a completely local view of the computation. It is therefore interesting that we can restrict such code duplications to a small constant number of edges. In this respect, we are mainly inspired by local implementations of linear logic boxes [7] and Parrow s trios [18]. In our solos calculus, boxes may be decomposed to boxes of three edges, without a ecting the expressiveness: Theorem 12 (Decomposition) eu) n Y i=1 i ) z i 1 i n ) n Y i=1 (eu) z i e u j i j z i 1 e u) 9 z y x z y x Fig. 6. The edge box reduction x yz j ....

J. Parrow. Trios in concert. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing. MIT Press, May 2000.


Solo Diagrams - Laneve, Parrow, Victor (2001)   (2 citations)  Self-citation (Parrow)   (Correct)

....among edges and hinders a completely local view of the computation. It is therefore interesting that we can restrict such code duplications to a small constant number of edges. In this respect, we are mainly inspired by local implementations of linear logic boxes [7] and Parrow s trios [15]. In our calculus of solos, boxes may be decomposed to boxes of three edges, without a ecting the expressiveness: Theorem 22 (Decomposition) eu) n Y i=1 i ) z i 1 i n ) n Y i=1 (eu) z i e u j i j z i 1 e u) where i are solos, z i , 1 i n are pairwise distinct ....

J. Parrow. Trios in concert. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing, May 2000.


Decoding Choice Encodings - Nestmann, Pierce (1996)   (52 citations)  (Correct)

No context found.

Joachim Parrow. Trios in Concert. (Draft), July 1995.


Nomadic π-Calculi: Expressing and Verifying Communication.. - Unyapoth (2001)   (Correct)

No context found.

Joachim Parrow. Trios in concert. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. Massachusetts Institute of Technology, 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