by Davide Sangiorgi
In Proc. Ninth International Conference on the Mathematical Foundations of Programming Semantics (MFPS'93
ftp://ftp-sop.inria.fr/meije/theorie-par/davides/la.ps.Z
Add To MetaCart
Abstract:
Abstract. In [Mil90] Milner examines the encoding of the-calculus into the-calculus [MPW92]. The former is the universally accepted basis for computations with functions, the latter aims at being its counterpart for computations with processes. The primary goal of this paper is to continue the study of Milner's encodings. We focus mainly on the lazy-calculus [Abr87]. We show that its encoding gives rise to a-model, in which a To obtain full abstraction, we examine both the restrictive approach, in which the semantic domain of processes is cut down, and the expansive approach, in which-calculus is enriched with constants to obtain a direct characterisation of the equivalence on-terms induced, via the encoding, by the behavioural equivalence adopted on the processes. Our results are derived exploiting an intermediate representation of Milner's encodings into the Higher-Order-calculus, an!-order extension of-calculus where also agents may be transmitted. For this, essential use is made of the fully abstract compilation from the Higher-Order-calculus to the-calculus studied in [San92a].
Citations
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
886
|
A Calculus of Mobile Processes
– Milner, Parrow, et al.
- 1992
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
316
|
The polyadic -calculus: a tutorial
– Milner
- 1991
|
|
245
|
The Lambda-Calculus, its Syntax and Semantics, volume 103
– Barendregt
- 1984
|
|
232
|
Expressing Mobility in Process Algebras: First-Order and HigherOrder Paradigms
– Sangiorgi
- 1992
|
|
220
|
Typing and subtyping for mobile processes
– Pierce, Sangiorgi
- 1996
|
|
191
|
Introduction to combinators and *-calculus
– Hindley, Seldin
- 1988
|
|
181
|
Barbed bisimulation
– Milner, Sangiorgi
- 1992
|
|
120
|
Full abstraction in the lazy lambda calculus
– Abramsky, Ong
- 1993
|
|
103
|
Fully Abstract Models of Typed Lambda-Calculi
– Milner
- 1977
|
|
97
|
Calculi for Higher Order Communicating Systems
– Thomsen
- 1990
|
|
58
|
Towards a lambda calculus for concurrent and communicating systems
– Boudol
- 1989
|
|
50
|
The Lazy Lambda Calculus in a Concurrency Scenario
– Sangiorgi
- 1994
|
|
35
|
Lambda-calculus models and extensionality
– Hindley, Longo
- 1980
|
|
32
|
Domain Theory and the Logic of Observable Properties
– Abramsky
- 1987
|
|
25
|
A Lambda Calculus for (Strict) Parallel Functions
– Boudol
- 1994
|
|
25
|
LCF as a Programming Language
– Plotkin
- 1977
|
|
13
|
Functions as processes. Research Report 1154, INRIA, Sofia Antipolis
– Milner
- 1990
|
|
7
|
Call by name, call by value and the -calculus
– Plotkin
- 1975
|