Skip to Main content Skip to Navigation
New interface
Conference papers

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. The conditions are presented in the π-calculus but can be adapted to other concurrency formalisms.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Davide Sangiorgi Connect in order to contact the contributor
Submitted on : Tuesday, December 9, 2014 - 3:17:17 PM
Last modification on : Tuesday, September 6, 2022 - 2:42:06 PM
Long-term archiving on: : Tuesday, March 10, 2015 - 11:51:55 AM


Files produced by the author(s)




Davide Sangiorgi, Xian Xu. Trees from Functions as Processes. 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.78 - 92, ⟨10.1007/978-3-662-44584-6_7⟩. ⟨hal-01092809⟩



Record views


Files downloads