Global/Local Subtyping for a Distributed pi-calculus
In the design of mobile agent programming languages there is a
tension between the implementation cost and the expressiveness of the
communication mechanisms provided. This paper gives a static
type system for a distributed pi-calculus
in which the input and output capabilities of channels may be either
global or local. This allows compile-time optimization where possible
but retains the expressiveness of channel communication. Subtyping
allows all communications to be invoked uniformly. Recursive types
and products are included.
The distributed pi-calculus used integrates location and migration
primitives from the Distributed Join Calculus with asynchronous pi
communication, taking a simple reduction semantics. Some alternative
calculi are discussed.
Back to my home page.