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. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Sangiorgi, D., & Xu, X. (2014). Trees from functions as processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704 LNCS, pp. 78–92). Springer Verlag. https://doi.org/10.1007/978-3-662-44584-6_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
