HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

A lambda-calculus for parallel functions

Gérard Boudol 1
1 MEIJE - Concurrency, Synchronization and Real-time Programming
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We study a l-calculus enriched with a non-deterministic choice combinator. We show that this combinator is adequately interpreted as the join in a canonical lattice of (parallel) continuous functions. The canonical model is in fact a logical one, concretely presented in a "typing system". Having established the complteness of this system, we show that the canonical interpretation provides us with a fully abstract model of the l-calculus with join. The proof of completeness relies upon the definability of the finite points of the logical domain.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 5:58:45 PM
Last modification on : Friday, February 4, 2022 - 3:19:26 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 10:34:00 PM


  • HAL Id : inria-00075327, version 1



Gérard Boudol. A lambda-calculus for parallel functions. [Research Report] RR-1231, INRIA. 1990, pp.48. ⟨inria-00075327⟩



Record views


Files downloads