Trees from Functions as Processes

Davide Sangiorgi 1, 2 Xian Xu 3
2 FOCUS - Foundations of Component-based Ubiquitous Systems
CRISAM - Inria Sophia Antipolis - Méditerranée , DISI - Dipartimento di Informatica - Scienza e Ingegneria [Bologna]
Abstract : 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.
Type de document :
Communication dans un congrès
25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.78 - 92, 2014, 〈10.1007/978-3-662-44584-6_7〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01092809
Contributeur : Sangiorgi Davide <>
Soumis le : mardi 9 décembre 2014 - 15:17:17
Dernière modification le : samedi 27 janvier 2018 - 01:31:32
Document(s) archivé(s) le : mardi 10 mars 2015 - 11:51:55

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

160

Téléchargements de fichiers

78