Eager Functions as Processes (long version) - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2022

Eager Functions as Processes (long version)

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 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.
Fichier principal
Vignette du fichier
efp.pdf (539.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03466150 , version 1 (04-12-2021)
hal-03466150 , version 2 (10-12-2021)
hal-03466150 , version 3 (04-02-2022)

Identifiers

Cite

Adrien Durier, Daniel Hirschkoff, Davide Sangiorgi. Eager Functions as Processes (long version). Theoretical Computer Science, In press, ⟨10.1016/j.tcs.2022.01.043⟩. ⟨hal-03466150v3⟩
74 View
68 Download

Altmetric

Share

Gmail Facebook X LinkedIn More