Eager Functions as Processes

Adrien Durier (1, 2) , Daniel Hirschkoff (1, 2) , Davide Sangiorgi (3, 4)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 PLUME - Preuves et Langages
3 UNIBO - Alma Mater Studiorum Università di Bologna = University of Bologna
4 FOCUS - Foundations of Component-based Ubiquitous Systems

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 normal-form 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.

Mots clés: pi-calculus; lambda-calculus; full abstraction; call-by-value

Domaines: Logique en informatique [cs.LO]

Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Eager Functions as Processes. the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2018, Oxford, United Kingdom. ⟨10.1145/3209108.3209152⟩. ⟨hal-01917255v2⟩