Functions as processes

This paper exhibits accurate encodings of the λ-calculus in the π-calculus. The former is canonical for calculation with functions, while the latter is a recent step (Milner et al. 1989) towards a canonical treatment of concurrent processes. With quite simple encodings, two λ-calculus reduction strategies are simulated very closely; each reduction in λ-calculus is mimicked by a short sequence of reductions in π-calculus. Abramsky's precongruence of applicative bisimulation (Abramsky 1989) over λ-calculus is compared with that induced by the encoding of the lazy λ-calculus into π-calculus; a similar comparison is made for call-by-value λ-calculus.

[1]  David Walker,et al.  Pi-Calculus Semantics of Object-Oriented Programming Languages , 1991, TACS.

[2]  David Turner,et al.  Research topics in functional programming , 1990 .

[3]  S. Abramsky.  The lazy lambda calculus , 1990 .

[4]  Bent Thomsen,et al.  Calculi for higher order communicating systems , 1990 .

[5]  Martín Abadi,et al.  Explicit substitutions , 1989, POPL '90.

[6]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[7]  Gérard Boudol.  Towards a Lambda-Calculus for Concurrent and Communicating Systems , 1989, TAPSOFT, Vol.1.

[8]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[10]  C.-H. Luke Ong,et al.  Fully abstract models of the lazy lambda calculus , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[11]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[12]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[13]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[14]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[15]  Elena Zucca,et al.  Parametric Channels via Label Expressions in CCS , 1984, Theor. Comput. Sci..

[16]  William D. Clinger,et al.  Foundations of Actor Semantics , 1981 .

[17]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[18]  Carl Hewitt,et al.  Viewing Control Structures as Patterns of Passing Messages , 1977, Artif. Intell..

[19]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[20]  Gordon D. Plotkin,et al.  Call-by-Name, Call-by-Value and the lambda-Calculus , 1975, Theor. Comput. Sci..

[21]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..