A Syntactic Theory of Message Passing
- 1 April 1980
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 27 (2) , 365-383
- https://doi.org/10.1145/322186.322199
Abstract
Recent developments by Hewitt and others have stimulated interest in message-passing constructs as an alternative to the more conventional applicative semantics on which most current languages are based. The present work illuminates the distinction between applicative and message-passing semantics by means of the μ -calculus, a syntactic model of message-passing systems similar in mechanism to the λ-calculus. Algorithms for the translation of expressions from the λ- to the μ -calculus are presented, and differences between the two approaches are discussed. Message-passing semantics seem particularly applicable to the study of multiprocessing. The μ -calculus, through the mechanism of conduits, provides a simple model for a limited but interesting class of parallel computations. Multiprocessing capabilities of the μ -calculus are illustrated, and multiple-processor implementations are discussed briefly.Keywords
This publication has 2 references indexed in Scilit:
- Synchronization with eventcounts and sequencersCommunications of the ACM, 1979
- The UNIX time-sharing systemCommunications of the ACM, 1974