Lambda-Calculus, Multiplicities and the pi-Calculus

Gérard Boudol 1 Cosimo Laneve
1 MEIJE - Concurrency, Synchronization and Real-time Programming
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this paper we study the semantics of the $\lambda$-calculus induced by Milner's encoding into the $\pi$-calculus. We show that the resulting may testing preorder on $\lambda$-terms coincides with the inclusion of Lévy-Longo trees. To establish this result, we use a refinement of the $\lambda$-calculus where the argument of a function may be of limited availability. In our $\lambda$-calculus with multiplicities, evaluation is deterministic, but it may deadlock, due to the lack of resources. We show that this feature is enough to make the $\lambda$-calculus as discriminating as the $\pi$-calculus.
Type de document :
[Research Report] RR-2581, INRIA. 1995, pp.33
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 14:31:56
Dernière modification le : samedi 27 janvier 2018 - 01:31:29
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:18:13



  • HAL Id : inria-00074103, version 1



Gérard Boudol, Cosimo Laneve. Lambda-Calculus, Multiplicities and the pi-Calculus. [Research Report] RR-2581, INRIA. 1995, pp.33. 〈inria-00074103〉



Consultations de la notice


Téléchargements de fichiers