Honda, K., Notes on Undirected Action Structure, a typescript, March, 1997. Available from http://www.dcs.qmw.ac.uk/~kohei. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Minimality and Separation Results on Asynchronous Mobile.. - Yoshida (1998) (9 citations) (Correct)
....by the result in [23] from a basis of at most 19 combinators we can generate the 36 asynchronous calculus with replication without using replication as an operator. We also remark that the binding nature of restriction is representable using naming action [33] or processes for connection [15, 16]. It may be interesting to check the essentiality of these agents to understand what computational elements are essential to express copies and name restriction in mobile processes. ffl Gay [12] and Lafont [26] independently found the systems of combinators of untyped interaction nets, and ....
....value x is thrown away. At the same time, the second value y is used as an output subject. Such phenomena lead to difficulty in the analysis and decomposition of prefixes. On the other hand, in the polyadic synchronous setting, there is a system of combinators for calculus in action structures [33, 16], and for a match summation less Fusion calculus [43] see [25] Measuring expressiveness in such a calculus following the line of this paper would be possible and interesting for examination of the expressiveness in the world of synchronous name passing. ffl Finally match and mismatch operators ....
Honda, K., Notes on Undirected Action Structure, a typescript, March, 1997. Available from http://www.dcs.qmw.ac.uk/~kohei.
Minimality and Separation Results on Asynchronous Mobile.. - Yoshida (1998) (9 citations) (Correct)
....by the result in [19] from a basis of at most 19 combinators we can generate the asynchronous calculus with replication without using replication as an operator. We also remark that the binding nature of restriction is representable using naming action [24] or processes for connection [13, 14]. It may be of interest to check the essentiality of these agents to understand what computational elements are essential to express copies and name restriction in mobile processes. ffl Raja and Shymasundar studied Quine combinators for the asynchronous calculus [34] and Parrow showed a ....
....value x is thrown away. At the same time, the second value y is used as an output subject. Such phenomena lead to difficulty in the analysis and decomposition of prefixes. On the other hand, in the polyadic synchronous setting, there is a system of combinators for calculus in action structures [24, 14], and for a match summation less Fusion calculus [31] see [20] Measuring expressiveness in such a calculus following the line of this paper would be possible and interesting for examination of synchronous name passing. ffl Finally match and mismatch operators are also significant from both ....
Honda, K., Notes on Undirected Action Structure, a typescript, March, 1997. Available from http://www.dcs.ed.ac.uk/home/kohei.
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