Trees from functions as processes

DOI10.1007/978-3-662-44584-6_7MaRDI QIDQ3190110zbMATH OpenOpenAlexFDO

Authors Davide Sangiorgi, Xian Xu

Publication date 15 September 2014

Published in CONCUR 2014 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.05797

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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.

Recommendations

• Trees from functions as processes
• scientific article; zbMATH DE number 177812
• Eager functions as processes
• Functions as processes
• From λ to π; or, Rediscovering continuations

Cited in

(9)

• Eager functions as processes
• On the relative expressiveness of higher-order session processes
• On the relative expressiveness of higher-order session processes
• STIT process and trees
• scientific article; zbMATH DE number 517055 (Why is no real title available?)
• Trees from functions as processes
• Divergence and unique solution of equations
• Eager functions as processes
• Tree process calculus

This page was built for publication: Trees from functions as processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190110)