Eager Functions as Processes

Adrien Durier 1, 2 Daniel Hirschkoff 1, 2 Davide Sangiorgi 3, 4
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
4 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

Contributor : Daniel Hirschkoff <>
Submitted on : Monday, November 19, 2018 - 12:11:17 PM
Last modification on : Friday, June 21, 2019 - 12:02:01 PM
Long-term archiving on : Wednesday, February 20, 2019 - 2:20:23 PM


Files produced by the author(s)



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-01917255⟩



Record views


Files downloads