Bundgaard, M. and Sassone, V.
Typed polyadic pi-calculus in bigraphs.
In, 8th Symposium on Principles ad Practice of Declarative Programming, PPDP'06
ACM Press, .
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.
Actions (login required)