Faster combinator reduction using stock hardware

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Faster combinator reduction using stock hardware

Full text

Pdf (679 KB)

Source

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

Snowbird, Utah, United States

Pages: 235 - 243

Year of Publication: 1988

ISBN:0-89791-273-X

Author

A. C. Norman

Trinity College, Cambridge, CB2 1TQ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 11, Citation Count: 2

Additional Information:

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/62678.62716 What is a DOI?

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	"Selected reprints on dataflow and reduction architectures", S. S. Thakkar (ed). IEEE Computer Society Press, 1987.
	2	"Compiler construction", Aho, Sethi and Ullman, Addison Wesley.
	3	"Graph Reduction", J. H. Fasel and R. M. Keller (eds), Springer LNCS 279, I987
	4	"The second RIKEN international symposium on symbolic and algebraic computation by computers", N. Inada and T Soma (eds), World Scientific, 1985.
	5	"Dissertation for the Diploma in Computer Science", T. J. W, Clarke, University of Cambridge, 1984
	6	"AMD 29000 reference manual", AMD
	7	"The ARM datasheet", Acom Computers, distributed through VTI.
	8	"The Norcroft C Compiler", A. C. Norman and A. Mycroft, Acorn Computers, 1987.

CITED BY 2

	P. J. Koopman, Jr. , P. Lee, A fresh look at combinator graph reduction, ACM SIGPLAN Notices, v.24 n.7, p.110-119, July 1989
	Philip J. Koopman, Jr. , Peter Lee , Daniel P. Siewiorek, Cache behavior of combinator graph reduction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.14 n.2, p.265-297, April 1992