摘要：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 respectto such trees. We apply these conditions to various encodings of thecall-by-name {\lambda}-calculus, showing how the two kinds of tree can beobtained by varying the behavioural equivalence adopted in the {\pi}-calculusand/or the encoding.
