Lexically scoped distribution: what you see is what you get

We dene a lexically scoped, asynchronous and distributed -calculus, with local communication and process migration. This calculus adopts the network-awareness principle for distributed programming and follows a simple model of distribution for mobile calculi: a lexical scope discipline combines static scoping with dynamic linking, associating channels to a xed site throughout computation. This discipline provides for both remote invocation and process migration. A simple type system is a straightforward extension of that of the -calculus, adapted to take into account the lexical scope of channels. An equivalence law captures the essence of this model: a process behavior depends on the channels it uses, not on where it runs.