Joachim Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407--443, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generating Type Systems for Process Graphs - König (1999) (1 citation) (Correct)
....process properties. This allows a systematic approach to obtaining correctness proofs for generated type systems. It is not clear to us how the same e ect could be achieved by a string representation of processes. There are several papers describing various ways of representing processes by graphs [14, 16, 9, 18]. Our method is closest to [9] but di ers in several aspects, the most prominent being that we employ hierarchical hypergraphs. Pure graph structure (or hypergraph structure in our case) is ordinarily not su cient to capture relevant properties of a process. We therefore enrich our types by ....
Joachim Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407-443, 1995.
Solos in Concert - Laneve, Victor (1999) (2 citations) (Correct)
....objects changed to wwz. When such input and output solos interact, the result is a fusion of the names z and w on each side of the interaction, thus triggering the continuations P and Q. Increasing polyadicity of names to encode the temporal ordering of prefixes was also used by Parrow in [12]. To get acquainted with the encoding of Table 2 we detail the interactions of the encoding of two parallel agents: x) u x : P j u y : Q) def = x) zw) u xzww j [z = w] P ] j (zw) u ywwz j [z = w] Q] j (xz 1 z 2 w 1 w 2 ) u xz 1 w 1 w 1 j [z 1 = w 1 ] P ] j u yw 2 w 2 z 2 j ....
J. Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407--443, 1995.
Solo Diagrams - Laneve, Parrow, Victor (2001) (2 citations) Self-citation (Parrow) (Correct)
....every reduction in MSD corresponds to a fusion action in the calculus of solos with the semantics of Figure 10, and vice versa. Finally, basic MSDs can be extended with boxes, in the style of section 3. 6 Related Work The direct ancestor of our solo diagrams are Parrow s Interaction Diagrams [17], which were presented as a graphical form of the calculus. Interaction Diagrams are more complex, due to the asymmetries of calculus. Three types of nodes are used, corresponding to parameters, input bound names, and other names, respectively. To encode input pre xing, Parrow uses a method ....
J. Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407-443, 1995.
Categorical Structure of Continuation Passing Style - Thielecke (1997) (18 citations) (Correct)
No context found.
Joachim Parrow. Interaction diagrams. Nordic Journal of Computing, 2:407--443, 1995.
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