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.
Type de document :
Rapport
[Research Report] RR-1231, INRIA. 1990, pp.48
Liste complète des métadonnées

https://hal.inria.fr/inria-00075327
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 17:58:45
Dernière modification le : samedi 27 janvier 2018 - 01:31:02
Document(s) archivé(s) le : mardi 12 avril 2011 - 22:34:00

Fichiers

Identifiants

  • HAL Id : inria-00075327, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

92

Téléchargements de fichiers

120