Towards a lambda-calculus for concurrent and communicating systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 1988

Towards a lambda-calculus for concurrent and communicating systems

Résumé

We introduce a calculus for concurrent and communicating processes, which is a direct and simple extension of the lambda-calculus. The communication mechanism we use is that of Milner's calculus CCS: to communicate consists in synchronously sending and receiving a value through a shared port. Then the calculus is parameterized on a given set of port names, which are used in the two primitives for sending and receiving a value -as in the lambda-calculus, a value can be any term. We use two parallel constructs: the first is interleaving, which does not allow communication between agents. The second, called cooperation, is a synchronizing construct which forces two agents to communicate on every port name. We show that the lambda-calculus is a simple sub-calculus of ours: lambda-abstraction is a particular case of reception (on a port named lambda), and application is a particular case of cooperation.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-0885.pdf (900.24 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00075669 , version 1

Citer

Gérard Boudol. Towards a lambda-calculus for concurrent and communicating systems. [Research Report] RR-0885, INRIA. 1988, pp.11. ⟨inria-00075669⟩
138 Consultations
168 Téléchargements

Partager

Gmail Facebook X LinkedIn More