Towards a theory of (self) applicative communicating processes: A short note.

*(English)*Zbl 0695.68048Summary: A direct combination of the \(\lambda\)-calculus with concepts from concurrency is introduced. Abstraction and (self) application from the \(\lambda\)-calculus are maintained as primitive constructs in the combined calculus, which incorporates also notions of (non)deterministic choice, concurrent and sequential composition, communication, encapsulation, and hiding as in process algebra (CCS, etc.). In this setting \(\lambda\) is just an arbitrary port name without any special role. We give an operational semantics to the combined calculus, where process application appears as a generalization of function application. The combined calculus has great expressive power: recursive constructs appear through self application and data objects are just component processes in concurrent constructs.

##### MSC:

68Q99 | Theory of computing |

68N25 | Theory of operating systems |

03B40 | Combinatory logic and lambda calculus |

PDF
BibTeX
XML
Cite

\textit{H. Goeman}, Inf. Process. Lett. 34, No. 3, 139--142 (1990; Zbl 0695.68048)

Full Text:
DOI

##### References:

[1] | Boudol, G., Towards a lambda-calculus for concurrent and communicating systems, (), 149-161, CAAP, Lecture Notes in Computer Science |

[2] | Milner, R., A calculus of communicating systems, Lecture notes in computer science, 92, (1980), Springer Berlin · Zbl 0452.68027 |

[3] | Thomsen, B., A calculus of higher order communicating systems, Proc. POPL 89, SIGPLAN notices, (1989) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.