Skip to Main content Skip to Navigation
Journal articles

Trees from functions as processes

Davide Sangiorgi 1, 2 Xian Xu 3
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Davide Sangiorgi <>
Submitted on : Thursday, November 22, 2018 - 3:04:12 PM
Last modification on : Friday, October 30, 2020 - 12:04:04 PM


Files produced by the author(s)




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



Record views


Files downloads