T. J.W. Clarke
ABSTRACT
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.
- 1.Turner, D. A. "A new implementation technique for applicative languages" Software Practice & Experience, 1979Google Scholar
- 2.Norman, A. C. and Moore, P. M. A. "The design of a vector-based algebra system" Proc. EUROSAM 79, 1979 (Springer Lecture Notes in Computer Science 71, ed: E. Ng) Google ScholarDigital Library
- 3.Mycroft, A. "The theory and practice of transforming call-by-need into call-by-value" 4th Int. Colloq. on Programming, Paris 1980 Google ScholarDigital Library
- 4.Mago, G. "A network of microcomputers to execute reduction languages" Int. Jrnl. of Comp. & Inf. Sciences, Oct 79Google Scholar
- 5.Berkling, K.Google Scholar
- 6.Curry and Feys "Combinatory Logic" North HollandGoogle Scholar
- 7.BASIC Users manual, Acorn Computers, 4a Market Hill, Cambridge. 1980.Google Scholar
- 8.Fitch, J.P. and Norman, A. C. "Implementing LISP in a high-level language" Software Practice and Experience, 1977.Google Scholar
Index Terms
- SKIM - The S, K, I reduction machine
Recommendations
A machine-independent APL interpreter
The problem of writing machine-independent APL interpreters is solved by means of a systems programming approach making use of an intermediate level language specially designed for that purpose. This paper describes the language, as well as the ...
Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine
FLOPS '01: Proceedings of the 5th International Symposium on Functional and Logic ProgrammingA systematic method of compiling lazy functional programs based on the Spineless Tagless G-machine (STGM) is presented for the Java Virtual Machine (JVM). A new specification of the STGM, which consists of a compiler and a reduction machine, is ...
Comments