Trees from Functions as Processes

by   Davide Sangiorgi, et al.

Levy-Longo Trees and Bohm Trees are the best known tree structures on the λ-calculus. We give general conditions under which an encoding of the λ-calculus into the π-calculus is sound and complete with respect to such trees. We apply these conditions to various encodings of the call-by-name λ-calculus, showing how the two kinds of tree can be obtained by varying the behavioural equivalence adopted in the π-calculus and/or the encoding.


page 1

page 2

page 3

page 4


Eager Functions as Processes (long version)

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...

Eager Functions as Processes

We study Milner's encoding of the call-by-value λ-calculus into the π-ca...

Degrees of extensionality in the theory of Böhm trees and Sallé's conjecture

The main observational equivalences of the untyped lambda-calculus have ...

N-ary Huffman Encoding Using High-Degree Trees – A Performance Comparison

In this paper we implement an n-ary Huffman Encoding and Decoding applic...

Simply typed convertibility is TOWER-complete even for safe lambda-terms

We consider the following decision problem: given two simply typed λ-ter...

BDD-based reasoning in the fluent calculus - first results

The paper reports on first preliminary results and insights gained in a ...

An Uncertainty Management Calculus for Ordering Searches in Distributed Dynamic Databases

MINDS is a distributed system of cooperating query engines that customiz...

Please sign up or login with your details

Forgot password? Click here to reset