%T Locality Based Linda: Programming with Explicit Localities
%P 712-726
%V 1214
%I Springer
%X In this paper we investigate the issue of defining a programming calculus which supports programming with explicit localities. We introduce a language which embeds the asynchronous Linda communication paradigm extended with explicit localities in a process calculus. We consider multiple tuple spaces that are distributed over a collections of sites and use localities to distribute/retrieve tuples and processes over/from these sites. The operational semantics of the language turns out to be useful for discussing the language design, e.g. the effects of scoping disciplines over mobile agents which maintain their connections to the located tuple spaces while moving along sites. The flexibility of the language is illustrated by a few examples.
%E Michel Bidoit
%E Max Dauchet
%L eprints354
%D 1997
%S Lecture Notes in Computer Science
%A Rocco De Nicola
%A GianLuigi Ferrari
%A Rosario Pugliese
%R 10.1007/BFb0030636
%B TAPSOFT '97: Theory and Practice of Software Development