SKIM - The S, K, I reduction machine

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

SKIM - The S, K, I reduction machine

Full text

Pdf (635 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1980 ACM conference on LISP and functional programming table of contents

Stanford University, California, United States

Pages: 128 - 135

Year of Publication: 1980

Authors

T. J.W. Clarke
P. J.S. Gladstone
C. D. MacLean
A. C. Norman

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 40, Citation Count: 15

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/800087.802798 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Turner, D. A. "A new implementation technique for applicative languages" Software Practice & Experience, 1979
	2	A. C. Norman , P. M. A. Moore, The initial design of a vector based algebra system, Proceedings of the International Symposiumon on Symbolic and Algebraic Computation, p.258-265, June 01, 1979
	3	Alan Mycroft, 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, p.269-281, April 22-24, 1980
	4	Mago, G. "A network of microcomputers to execute reduction languages" Int. Jrnl. of Comp. & Inf. Sciences, Oct 79
	5	Berkling, K.
	6	Curry and Feys "Combinatory Logic" North Holland
	7	BASIC Users manual, Acorn Computers, 4a Market Hill, Cambridge. 1980.
	8	Fitch, J.P. and Norman, A. C. "Implementing LISP in a high-level language" Software Practice and Experience, 1977.

CITED BY 15

	Lal George, An abstract machine for parallel graph reduction, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.214-229, September 11-13, 1989, Imperial College, London, United Kingdom
	A. Guha , R. Ramnarayan , M. Derstine, Architectural issues in designing symbolic processors in optics, Proceedings of the 14th annual international symposium on Computer architecture, p.145-151, June 02-05, 1987, Pittsburgh, Pennsylvania, United States
	Mitchell Wand, Semantics-directed machine architecture, Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.234-241, January 25-27, 1982, Albuquerque, Mexico
	Neil D. Jones , Steven S. Muchnick, A fixed-program machine for combinator expression evaluation, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.11-20, August 15-18, 1982, Pittsburgh, Pennsylvania, United States
	Frank N. Kautzmann, III, A methodology for multiple rule system integration and resolutions within a singular knowledge base, Proceedings of the 15th annual conference on Computer Science, p.16-26, February 1987, St. Louis, Missouri, United States
	J. A. Davis, A functional language architecture that supports fine-grain parallelism (extended abstract), Proceedings of the 15th annual conference on Computer Science, p.384, February 1987, St. Louis, Missouri, United States
	Philip C. Treleaven , David R. Brownbridge , Richard P. Hopkins, Data-Driven and Demand-Driven Computer Architecture, ACM Computing Surveys (CSUR), v.14 n.1, p.93-143, March 1982
	Paul Hudak , Benjamin Goldberg, Experiments in diffused combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.167-176, August 06-08, 1984, Austin, Texas, United States
	Richard Kennaway , Ronan Sleep, Director strings as combinators, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.4, p.602-626, Oct. 1988
	Simon L Peyton Jones, An investigation of the relative efficiencies of combinators and lambda expressions, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.150-158, August 15-18, 1982, Pittsburgh, Pennsylvania, United States
	F. Warren Burton, Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.2, p.159-174, April 1984
	Paul Hudak , David Kranz, A combinator-based compiler for a functional language, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.122-132, January 15-18, 1984, Salt Lake City, Utah, United States
	W. R. Stoye , T. J. W. Clarke , A. C. Norman, Some practical methods for rapid combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.159-166, August 06-08, 1984, Austin, Texas, United States
	Brent Hailpern , Tien Huynh , Gyorgy Revesz, Comparing Two Functional Programming Systems, IEEE Transactions on Software Engineering, v.15 n.5, p.532-542, May 1989
	B Wah , G J Li, Survey on special purpose computer architectures for AI, ACM SIGART Bulletin