Technical reports
Global/local subtyping for a distributed π-calculus
August 1997, 57 pages
DOI: 10.48456/tr-435
Abstract
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 π-calculus in which the input and output 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 π-calculus used integrates location and migration primitives from the Distributed Join Calculus with asynchronous π communication, taking a simple reduction semantics. Some alternative calculi are discussed.
Full text
PS (0.2 MB)
BibTeX record
@TechReport{UCAM-CL-TR-435, author = {Sewell, Peter}, title = {{Global/local subtyping for a distributed $\pi$-calculus}}, year = 1997, month = aug, url = {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-435.ps.gz}, institution = {University of Cambridge, Computer Laboratory}, doi = {10.48456/tr-435}, number = {UCAM-CL-TR-435} }