Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00074103
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:31:56 PM
Last modification on : Saturday, January 27, 2018 - 1:31:29 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:18:13 PM

Identifiers

  • HAL Id : inria-00074103, version 1

Collections

Citation

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

Share

Metrics

Record views

181

Files downloads

321