文献类型：期刊文献

英文题名：TREES FROM FUNCTIONS AS PROCESSES

作者：Sangiorgi, Davide[1];Xu, Xian

机构：[1]Univ Bologna, Bologna, Italy; INRIA, Rocquencourt, France; East China Univ Sci & Technol, Shanghai, Peoples R China

年份：2018

卷号：14

期号：3

外文期刊名：LOGICAL METHODS IN COMPUTER SCIENCE

收录：;EI(收录号：20184506032487);WOS:【SCI-EXPANDED(收录号:WOS:000450660200020)】；

基金：This work has been supported by project ANR 12IS02001 'PACE', NSF of China (61261130589), and partially supported by NSF of China (61702334, 61772336, 61572318, 61472239, 61872142).

语种：英文

外文关键词：Encoding (symbols) - Trees (mathematics)

摘要：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.