Synchronization with eventcounts and sequencers
Communications of the ACM
Communications of the ACM
The incremental garbage collection of processes
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Proceedings of ACM conference on Proving assertions about programs
FUNCTIONAL DOMAINS OF APPLICATIVE LANGUAGES
FUNCTIONAL DOMAINS OF APPLICATIVE LANGUAGES
Lambda: The Ultimate Imperative
Lambda: The Ultimate Imperative
LAMBDA: The Ultimate Declarative
LAMBDA: The Ultimate Declarative
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Using continuations to implement thread management and communication in operating systems
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
The MuNet: A scalable decentralized architecture for parallel computation
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The use of APL in a concurrent data flow environment
APL '82 Proceedings of the international conference on APL
The Apiary network architecture for knowledgeable systems
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
JDA: a step towards large-scale reuse on the web
Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
The von Neumann architecture is due for retirement
HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems
| Hi-index | 0.00 |
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 &mgr;-calculus, a syntactic model of message-passing systems similar in mechanism to the &lgr;-calculus. Algorithms for the translation of expressions from the &lgr;- to the &mgr;-calculus are presented, and differences between the two approaches are discussed.Message-passing semantics seem particularly applicable to the study of multiprocessing. The &mgr;-calculus, through the mechanism of conduits, provides a simple model for a limited but interesting class of parallel computations. Multiprocessing capabilities of the &mgr;-calculus are illustrated, and multiple-processor implementations are discussed briefly.