Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
Functional Programming
A combinator-based compiler for a functional language
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
T: a dialect of Lisp or LAMBDA: The ultimate software tool
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
An investigation of the relative efficiencies of combinators and lambda expressions
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Garbage collection and task deletion in distributed applicative processing systems
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
The Apiary network architecture for knowledgeable systems
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
SKIM - The S, K, I reduction machine
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Distributed task and memory management
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Architectural issues in designing symbolic processors in optics
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Process and dataflow control in distributed data-intensive systems
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Implementing functional programs on a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Graphinators and the duality of SIMD and MIMD
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Mechanisms for efficient multiprocessor combinator reduction
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Para-functional programming: a paradigm for programming multiprocessor systems
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
| Hi-index | 0.01 |
In recent years there has been a fair amount of interest both in using combinators to represent functional programs, and in using graph reduction as an underlying valuation strategy. Combining these ideas within a single framework for an “applicative architecture” is very appealing because: (1) the normally ubiquitous “environment” is eliminated, (2) the evaluation strategy becomes very simple (amenable to VLSI), and (3) there is a great potential for parallelism. We have been exploring a model of diffused combinator reduction in which the reduction process is distributed “by demand” among a network of closely-coupled processors. We have tested our ideas via simulation, with encouraging results. This research was supported in part by NSF Grant MCS-8302018 and ONR Grant N00014-84-K-0043.