Lambda-Calculus, Multiplicities and the pi-Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1995

Lambda-Calculus, Multiplicities and the pi-Calculus

Cosimo Laneve
  • Function : Author


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2581.pdf (337.22 Ko) Télécharger le fichier

Dates and versions

inria-00074103 , version 1 (24-05-2006)


  • 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⟩
94 View
315 Download


Gmail Facebook Twitter LinkedIn More