A lambda-calculus for parallel functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1990

A lambda-calculus for parallel functions


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1231.pdf (2.3 Mo) Télécharger le fichier

Dates and versions

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


  • 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⟩
68 View
97 Download


Gmail Facebook Twitter LinkedIn More