Log In Sign Up

Eager Functions as Processes (long version)

by   Adrien Durier, et al.

We study Milner's encoding of the call-by-value λ-calculus into the π-calculus. We show that, by tuning the encoding to two subcalculi of the π-calculus (Internal π and Asynchronous Local π), the equivalence on λ-terms induced by the encoding coincides with Lassen's eager normalform bisimilarity, extended to handle η-equality. As behavioural equivalence in the π-calculus we consider contextual equivalence and barbed congruence. We also extend the results to preorders. A crucial technical ingredient in the proofs is the recently-introduced technique of unique solutions of equations, further developed in this paper. In this respect, the paper also intends to be an extended case study on the applicability and expressiveness of the technique.


page 1

page 2

page 3

page 4


Eager Functions as Processes

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...

Trees from Functions as Processes

Levy-Longo Trees and Bohm Trees are the best known tree structures on th...

Contextual Equivalence for Signal Flow Graphs

We extend the signal flow calculus—a compositional account of the classi...

Divergence and unique solution of equations

We study proof techniques for bisimilarity based on unique solution of e...

On sequentiality and well-bracketing in the π-calculus

The π -calculus is used as a model for programminglanguages. Its context...

A Theory of Encodings and Expressiveness

This paper proposes a definition of what it means for one system descrip...

Bisimulations for Delimited-Control Operators

We propose a survey of the behavioral theory of an untyped lambda-calcul...