We present a calculus of mobile processes without prefix or summation, and using two different encodings we show that it can express both action prefix and guarded summation. One encoding gives a strong correspondence but uses a match operator; the other yields a slightly weaker correspondence but uses no additional operators.

We present XPi, a core calculus for XML messaging. XPi features asynchronous communications, pattern matching, name and code mobility, integration of static and dynamic typing. Flexibility and expressiveness of this calculus is illustrated by a few examples, some concerning description and discovery of web services. In XPi, a type system disciplines XML message handling at the level of channels, patterns and processes.

this paper, we rewrite our modified semantics of jeblik in terms of the #-calculus, and we use it to formally prove the correctness of object surrogation, the abstraction of object migration in jeblik. Key Words: #-calculus, Objects, Migration 1.

We extend the #-calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of #-calculus, and makes it possible to derive divergence-free encodings of distributed calculi. We give a separation result between the #-calculus with polyadic synchronisation ( #) and the original calculus, in the style of an analogous result given by Palamidessi for mixed choice. We encode Local Area # showing how to control the local use of resources in #.