Trees from Functions as Processes
Logic in Computer Science
2023-06-22 v2
Abstract
Levy-Longo Trees and Bohm Trees are the best known tree structures on the {\lambda}-calculus. We give general conditions under which an encoding of the {\lambda}-calculus into the {\pi}-calculus is sound and complete with respect to such trees. We apply these conditions to various encodings of the call-by-name {\lambda}-calculus, showing how the two kinds of tree can be obtained by varying the behavioural equivalence adopted in the {\pi}-calculus and/or the encoding.
Cite
@article{arxiv.1804.05797,
title = {Trees from Functions as Processes},
author = {Davide Sangiorgi and Xian Xu},
journal= {arXiv preprint arXiv:1804.05797},
year = {2023}
}