MULTILISP: a language for concurrent symbolic computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Control
On the Development of the Algebra of Functional Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Proceedings of the International Colloquium on Formalization of Programming Concepts
Formal Representations for Recursively Defined Functional Programs
Proceedings of the International Colloquium on Formalization of Programming Concepts
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Some practical methods for rapid combinator reduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
A fixed-program machine for combinator expression evaluation
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
SKIM - The S, K, I reduction machine
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
| Hi-index | 0.00 |
Combinators are shown to provide a very suitable basis for implementations of functional and symbolic computation in computer architecture. A powerful combinator reduction system is developed which meets programmers and machine requirements for (i) efficiency of representation and execution of symbolic algorithms, and (ii) availability of algebraic manipulation needed to analyse symbolic computations. An algebraic model is constructed to provide rigorous semantics for the system. The reduction language of the system aims at exposing efficient flows of data and fine-grain parallelism, and a computer architecture, which is proposed to run the system, utilizes both sequential and parallel processing modes in order to achieve maximum efficiency of symbolic computation. Finally, an implementation of the interpreter and functional simulator for the architecture is described.