Abstract
Purchase PDF (275 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (333 K)
doi:10.1016/j.tcs.2006.02.006 
Copyright © 2006 Elsevier B.V. All rights reserved.
A CPS encoding of name-passing in Higher-order mobile embedded resources
Available online 3 March 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
We present an encoding of the synchronous π-calculus in the calculus of Higher-order mobile embedded resources (Homer), a pure higher-order calculus with mobile processes in nested locations, defined as a simple, conservative extension of the core process-passing subset of Thomsen's Plain CHOCS. We prove that our encoding is fully abstract with respect to barbed bisimulation and sound with respect to barbed congruence. Our encoding demonstrates that higher-order process-passing together with mobile resources in, possibly local, named locations are sufficient to express π-calculus name-passing. The encoding uses a novel continuation passing style to facilitate the encoding of synchronous communication.
Keywords: π-calculus; Name-passing encoding; Process-passing; Nested locations; Continuation-passing; Explicit substitutions
