Trees from functions as processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2018

Trees from functions as processes


Lévy-Longo Trees and Böhm Trees are the best known tree structures on the λ-calculus. We give general conditions under which an encoding of the λ-calculus into the π-calculus is sound and complete with respect to such trees. We apply these conditions to various encodings of the call-by-name λ-calculus, showing how the two kinds of tree can be obtained by varying the behavioural equivalence adopted in the π-calculus and/or the encoding.
Fichier principal
Vignette du fichier
main.pdf (505.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01931186 , version 1 (22-11-2018)



Davide Sangiorgi, Xian Xu. Trees from functions as processes. Logical Methods in Computer Science, 2018, ⟨10.2168/LMCS-14(3:11)2018⟩. ⟨hal-01931186⟩
60 View
44 Download



Gmail Facebook X LinkedIn More