Trees from Functions as Processes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Trees from Functions as Processes

Résumé

Lévy-Longo Trees and Böhm 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. The conditions are presented in the π-calculus but can be adapted to other concurrency formalisms.
Fichier principal
Vignette du fichier
main.pdf (190.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01092809 , version 1 (09-12-2014)

Identifiants

Citer

Davide Sangiorgi, Xian Xu. Trees from Functions as Processes. 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.78 - 92, ⟨10.1007/978-3-662-44584-6_7⟩. ⟨hal-01092809⟩

Collections

INRIA INRIA2
174 Consultations
100 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More