A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources | Zendy

Mikkel Bundgaard | Zendy; Thomas Hildebrandt | Zendy; Jens Chr. Godskesen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources

Author(s) -

Mikkel Bundgaard,

Thomas Hildebrandt,

Jens Chr. Godskesen

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.11.033

Subject(s) - encoding (memory) , bisimulation , computer science , process calculus , message passing , pi calculus , theoretical computer science , calculus (dental) , programming language , artificial intelligence , medicine , dentistry

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 (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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research