TY  - CHAP
ID  - eprints354
SP  - 712
Y1  - 1997///
AV  - none
M1  - 1214
UR  - http://dx.doi.org/10.1007/BFb0030636
ED  - Bidoit, Michel
ED  - Dauchet, Max
T2  - TAPSOFT '97: Theory and Practice of Software Development
PB  - Springer
SN  - 3-540-62781-2
A1  - De Nicola, Rocco
A1  - Ferrari, GianLuigi
A1  - Pugliese, Rosario
N2  - 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.
EP  - 726
T3  - Lecture Notes in Computer Science
TI  - Locality Based Linda: Programming with Explicit Localities
ER  -