ACM Transactions on Programming Languages and Systems (TOPLAS)
Types and programming languages
Types and programming languages
Resource access control in systems of mobile agents
Information and Computation
Journal of Functional Programming
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A theory of bisimulation for a fragment of concurrent ML with local names
Theoretical Computer Science
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
Mobility control via passports
Information and Computation
Parametrised Constants and Replication for Spatial Mobility
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Mobility control via passports
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 5.23 |
Dpi is a distributed version of the pi-calculus, in which processes are explicitly located, and a migration construct may be used for moving between locations. We argue that adding a recursion operator to the language increases significantly its descriptive power. But typing recursive processes requires the use of potentially infinite types. We show that the capability-based typing system of Dpi can be extended to co-inductive types so that recursive processes can be successfully supported. We also show that, as in the pi-calculus, recursion can be implemented via iteration. This translation improves on the standard ones by being compositional but still requires co-inductive types and comes with a significant migration overhead in our distributed setting.