Bundgaard, M. and Sassone, V.
Typed polyadic pi-calculus in bigraphs
At 8th Symposium on Principles ad Practice of Declarative Programming, PPDP'06.
Bigraphs have been introduced with the aim to provide a topographical meta-model for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus our attention on the typed polyadic ?-calculus with capability types `a la Pierce and Sangiorgi, which we represent using a novel kind of link sorting called subsorting. Using the theory of relative pushouts we derive a labelled transition system which yield a coinductive characterisation of a behavioural congruence for the calculus. The results obtained in this paper constitute a promising foundation for the presentation of various type systems for the (polyadic) ?-calculus as sortings in the setting of bigraphs.
Conference or Workshop Item
|Venue - Dates:
||8th Symposium on Principles ad Practice of Declarative Programming, PPDP'06, 2006-01-01
||bigraphs, typed polyadic pi-calculus, sortings, subsorting, bisimulation congruences, relative pushouts
||Web & Internet Science
||29 May 2006
||17 Apr 2017 21:39
|Further Information:||Google Scholar|
Actions (login required)