MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

An investigation into Functions as Processes (1993) [6 citations — 1 self]

by Davide Sangiorgi
In Proc. Ninth International Conference on the Mathematical Foundations of Programming Semantics (MFPS'93
Add To MetaCart

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 weak form of extensionality holds. However the model is not fully abstract: 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 ...

Citations

2701 Communication and Concurrency – Milner - 1989
847 A calculus of mobile processes – Milner, Parrow, et al. - 1992
540 Concurrency and Automata on Infinite Sequences – Park - 1981
276 The polyadic -calculus: a tutorial – Milner - 1991
243 The Lambda Calculus, Its Syntax and Semantics, volume 103 – Barendregt - 1984
218 Expressing Mobility in Process Algebras: First Order and Higher Order Paradigms – Sangiorgi - 1992
211 Typing and Subtyping for Mobile Processes – Pierce, Sangiorgi - 1993
179 Introduction to Combinators and *-Calculus – Hindley, Seldin - 1986
172 Barbed bisimulation – Milner, Sangiorgi - 1992
116 Full abstraction in the lazy lambda calculus – Abramsky, Ong - 1993
100 A calculus of higher order communicating systems – Thomsen - 1989
97 Fully abstract models of typed lambda-calculus – Milner - 1977
56 Towards a lambda-calculus for concurrent and communicating systems – Boudol - 1989
48 The Lazy Lambda Calculus in a Concurrency Scenario – Sangiorgi - 1992
37 Domain Theory and the Logic of Observable Properties – Abramsky - 1987
35 Lambda-calculus models and extensionality – Hindley, Longo - 1980
25 A Lambda-calculus for (Strict) Parallel Functions – Boudol - 1994
23 LCF as a Programming Language – Plotkin - 1977
13 Functions as processes. Research Report 1154, INRIA, Sophia Antipolis – Milner - 1990
7 Call by name, call by value and the -calculus – Plotkin - 1975