Honda, K., Two bisimilarities in -calculus. Keio CS report 92-002, Department of Computer Science, Keio University, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....parties. All routing of messages back and forth between parties is handled by the transport layer, that is the message notification system. The iScent framework does not attempt to replace existing message notification systems. Rather, it utilises a message notification system (currently Siena [26]) as infrastructure or backbone. The purpose of the iScent (intersubjective collaborative event environment) framework is to help people increase intersubjectivity and to augment their (collective) memory through the use of high fidelity persistent events. In the extreme case all tools used by a ....

....Hypertext Conference, pages 113 122, Pittsburgh, USA, 1998. BIBLIOGRAPHY 89 [25] L. A. Carr, D. D. Roure, W. Hall, and G. Hill. The distributed link service: A tool for publishers, authors and readers. In Proceedings of the 4 th International World Wide Web Conference, Boston, USA, 1995. W3C. [26] A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Achieving scalability and expressiveness in an Internet scale event notification service. In Proceedings of the 19 th ACM Symposium on Principles of Distributed Computing, July 2000. 27] J. Clark and S. DeRose (editors) XML Path language (XPath) ....

[Article contains additional citation context not shown here]

J. Grudin. Two analyses of CSCW and groupware. Technical Report 323, Department of Computer Science, University of Aarhus, Denmark, July 1990.

....network. 2.3 Related works Lower bound for the dilation problem for interval routing was first addressed by Ruzicka in [6, 7] He built a globe graph on which every interval routing scheme with one interval has dilation at least 5 3D=2. This result was improved later by Tse and Lau in [10, 11], for one interval with a lower bound of 7D=4 (based on an extension of the globe graph) and generalized to more than one interval with a lower bound still of 3D=2 up to Theta(log n) intervals, and of 5D=4 up to Theta( p n) intervals. Other results are also mentioned in [9] for dilation in ....

, Two lower bounds for multi-interval routing, Tech. Rep. TR-96-05, Department of Computer Science, The University of Hong Kong, Aug. 1996.

....: xn ) i) ob(ah(A)x 1 : xn i; i) def = x i . Using a sequence of input output labels, say t, for which we assume the usual binding relation and binding convention, the weak transition t = is again standard; and so is the weak bisimilarity (the late and early versions coincide [14]) We also use the following notion, cf. 23] a term P is strongly determinate when for each P 0 such that P Gamma P 0 , we have (1) P 0 l Gamma P 1 and P 0 l Gamma P 2 imply P 1 j P 2 ; 2) P 0 l Gamma (l an output) implies P 0 6 Gamma . FPC sorting. In the ....

K. Honda. Two bisimilarities in -calculus. Technical Report 92-002, Department of Computer Science, Keio University, 1992.

No context found.

Honda, K., Two bisimilarities in -calculus. Keio CS report 92-002, Department of Computer Science, Keio University, 1992.

....Indeed, from a calculus viewpoint, this restriction is equivalent to the limitation that a name received during an input cannot be used as an input channel. This restriction is present in Michele Boreale s i a calculus [3] and it has been shown that the asynchronous calculus of Boudol [4, 19] can be faithfully encoded in its fragment i a . To conclude, let us see, in some examples, how the blue calculus takes the best from both the functional and the process calculi world. It is possible to give example familiar 3 in fact, the same discussion appears in conclusion of this paper ....

....Type systems for Prolog have been extensively studied [31] and it should be possible to adapt them to our need. An other interesting contribution of this work are the consequences we can draw on the calculus. Simple translation exists between the blue calculus and the asynchronous calculus [4, 19]. Therefore, one can easily deduce that it is not possible to devise an implicit type system i# la MLj for the calculus along the lines of M . Indeed, the same arguments applies in each case. For the same reason, one can easily derive a polymorphic type system for i a , Michele Boreale s ....

K. Honda. Two bisimilarities for the -calculus. Technical Report 92-002, Department of Computer Science, Keio University, 1992.

....in (4.1) does give us a coherent relational theory of processes, and that it even has a natural counterpart in the name based theory, though we do not detail these points here. Further, the induced relational universe is closely related with the 4 We correct the erroneous statement in [23] which says the composition given by (4.1) corresponds to that of RPS rel . algebra of information flow in geometry of interaction[13, 14, 17] see [8] Thus, while not serving the present purpose, the status and the use of this relational universe is of independent interest. Observe we can ....

Honda, K. Notes on P-Algebra (1): Process Structure. Proc.TPPP'94, LNCS 907, Springer-Verlag, 1995. Also as UMCS-95-12-2, Department of Computer Science, University of Manchester, 1995.

.... ab Gamma Pfb=xg : In the above, ax:P denotes a process which receives a name through a port a and then launches P after appropriate substitution, ab is a message carrying a name b to a, and ; denotes concurrent composition. Thus, in the simplified system, which is now called calculus [11, 13], the output prefix has been taken away. What is significant is that this asynchronous construct can encode synchronous communication quite concisely [10, 4] and thus is capable of doing all that can be done by synchronous name passing, representing versatile interaction structures in a clean ....

....further topics. Many proofs are given only in outline. Details are found in [15] 2 The Asynchronous calculus 2. 1 Terms and Reduction calculus, an offspring of calculus [19, 20] is a small formalism of concurrency using the notion of asynchronous name passing as the interaction primitive [10, 11]. The simple primitive, coupled with the capability to generate new names, gives calculus enough power to construct versatile structures of interaction, just as the simple operation called application in calculus gives it enough power to construct any imaginable applicative behaviour. Below we ....

[Article contains additional citation context not shown here]

Honda, K., Two bisimilarities in -calculus. Keio CS report 92-002, Department of Computer Science, Keio University, 1992.

No context found.

Honda, K. Two bisimilarities in -calculus. Tech. Rep. 92-002, Keio University, Department of Computer Science, 1992.

No context found.

Kohei Honda. Two bisimilarities in -calculus. Technical Report 92-002, Keio University, Department of Computer Science, 1992.

No context found.

Kohei Honda. Two bisimilarities in -calculus. Technical Report 92-002, Keio University, Department of Computer Science, 1992.

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