Efficient demand-driven evaluation. Part 1
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communicating sequential processes
MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient demand-driven evaluation. Part 2
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Dataflow and eduction: data-driven and demand-driven distributed computation
Current trends in concurrency. Overviews and tutorials
Towards an intermediate language based on graph rewriting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Communication and concurrency
Deforestation: transforming programs to eliminate trees
Proceedings of the Second European Symposium on Programming
Programming linguistics
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
Automatic transformation of series expressions into loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
CML: A higher concurrent language
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Why functional programming matters
Research topics in functional programming
Compiling with continuations
Linear graph reduction: confronting the cost of naming
Linear graph reduction: confronting the cost of naming
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Properties of a first-order functional language with sharing
Theoretical Computer Science
Slivers: computational modularity via synchronized lazy aggregates
Slivers: computational modularity via synchronized lazy aggregates
ACM Computing Surveys (CSUR)
Monitors: an operating system structuring concept
Communications of the ACM
Revised report on the algorithmic language scheme
ACM SIGPLAN Lisp Pointers
Listlessness is better than laziness: Lazy evaluation and garbage collection at compile-time
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Journal of Functional Programming
| Hi-index | 0.00 |
Our purpose is to promote a second-class mechanism --- the synchronization barrier --- to a first-class value. We introduce the synchron, a novel synchronization mechanism that enables the coordination of a dynamically varying set of concurrent threads that share access to a first-class synchronization token. We demonstrate how synchrons can be used to modularly manage resources in cases where existing techniques are either inapplicable or non-modular. In particular, synchronized lazy aggregates enable the first space-efficient aggregate data decomposition of a wide range of algorithms. We also introduce explicit-demand graph reduction, a new semantic framework that we have developed to describe concurrency and explain the meaning of a synchron rendezvous.