The initial design of a vector based algebra system
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
The Theory and Practice of Transforming Call-by-need into Call-by-value
Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
Architectural issues in designing symbolic processors in optics
ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
Director strings as combinators
ACM Transactions on Programming Languages and Systems (TOPLAS)
Functional programming with combinators
Journal of Symbolic Computation
Comparing Two Functional Programming Systems
IEEE Transactions on Software Engineering
An abstract machine for parallel graph reduction
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A methodology for multiple rule system integration and resolutions within a singular knowledge base
CSC '87 Proceedings of the 15th annual conference on Computer Science
A functional language architecture that supports fine-grain parallelism (extended abstract)
CSC '87 Proceedings of the 15th annual conference on Computer Science
Data-Driven and Demand-Driven Computer Architecture
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantics-directed machine architecture
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A combinator-based compiler for a functional language
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Some practical methods for rapid combinator reduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Experiments in diffused combinator reduction
LFP '84 Proceedings of the 1984 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
| Hi-index | 0.00 |
SKIM is a computer built to explore pure functional programming, combinators as a machine language and the use of hardware to provide direct support for a high level language. Its design stresses simplicity and aims at providing minicomputer performance (in its particular application areas) for microcomputer costs. This paper discusses the high level reduction language that SKIM supports, the way in which this language is compiled into combinators and the hardware and microcode that then evaluate programs.