Sangiorgi, Davide and Xu, Xian - Trees from Functions as Processes

lmcs:4785 - Logical Methods in Computer Science, August 27, 2018, Volume 14, Issue 3
Trees from Functions as Processes

Authors: Sangiorgi, Davide and Xu, Xian

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.


Source : oai:arXiv.org:1804.05797
DOI : 10.23638/LMCS-14(3:11)2018
Volume: Volume 14, Issue 3
Published on: August 27, 2018
Submitted on: April 19, 2018
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 48 times.
This article's PDF has been downloaded 17 times.