A combinator-based compiler for a functional language

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A combinator-based compiler for a functional language

Full text

Pdf (917 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages table of contents

Salt Lake City, Utah, United States

Pages: 122 - 132

Year of Publication: 1984

ISBN:0-89791-125-3

Authors

Paul Hudak	Yale University, Department of Computer Science
David Kranz	Yale University, Department of Computer Science

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGAPL: ACM Special Interest Group on APL Programming Language

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 35, Citation Count: 14

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/800017.800523 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	Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
	2	Daniel G. Bobrow , Ben Wegbreit, A model and stack implementation of multiple environments, Communications of the ACM, v.16 n.10, p.591-603, Oct. 1973 [doi>10.1145/362375.362379]
	3	Douglas W. Clark , C. Cordell Green, An empirical study of list structure in Lisp, Communications of the ACM, v.20 n.2, p.78-87, Feb. 1977 [doi>10.1145/359423.359427]
	4	T. J.W. Clarke , P. J.S. Gladstone , C. D. MacLean , A. C. Norman, SKIM - The S, K, I reduction machine, Proceedings of the 1980 ACM conference on LISP and functional programming, p.128-135, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802798]
	5	Curry, H.K., and Feys, R. Combinatoroy Logic. Noth-Holland Pub. Co., Amsterdam, 1958.
	6	Peter Henderson, Functional Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1980
	7	R. J. M. Hughes, Super-combinators a new implementation method for applicative languages, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.1-10, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802129]
	8	Keller, R.M. FEL programmer's guide. AMPS TR 7, University of Utah, March, 1982.
	9	Drew McDermott, An efficient environment allocation scheme in an interpreter for a lexically-scoped LISP, Proceedings of the 1980 ACM conference on LISP and functional programming, p.154-162, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802801]
	10	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 [doi>10.1145/800068.802130]
	11	Mycroft, A. Call-by-need &equil; call-by-value + conditional. Draft, Dept. of Comp. Sc., Univ. of Edinburugh, 1981.
	12	Jonathan A. Rees , Norman I. Adams IV, T: a dialect of Lisp or LAMBDA: The ultimate software tool, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.114-122, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802142]
	13	Schonfinkel, M. Uber die bausteine der mathematischen logik. Mathematische Annalen 92:305, 1924.
	14	Guy Lewis Steele, Jr., Debunking the “expensive procedure call” myth or, procedure call implementations considered harmful or, LAMBDA: The Ultimate GOTO, Proceedings of the 1977 annual conference, p.153-162, January 1977 [doi>10.1145/800179.810196]
	15	Guy L. Steele, Jr., Rabbit: A Compiler for Scheme, Massachusetts Institute of Technology, Cambridge, MA, 1978
	16	Steele, G.L. and Sussman, G.J. The Revised Report on Scheme. AI 452, MIT, January, 1978.
	17	Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977
	18	Turner, D.A. SASL language manual. Technical Report, University of St. Andrews, 1976.
	19	Turner, D.A. A new implementation technique for applicative languages. Software-Practice and Experience 9:31-49, 1979.
	20	Turner, D.A. Another algorithm for bracket abstraction. The Journal of Symbolic Logic 44(2):267-270, June, 1979.

CITED BY 14

	Thomas Johnsson, Efficient compilation of lazy evaluation, ACM SIGPLAN Notices, v.19 n.6, p.58-69, June 1984
	Paul Hudak , Eric Hohr, Graphinators and the duality of SIMD and MIMD, Proceedings of the 1988 ACM conference on LISP and functional programming, p.224-234, July 25-27, 1988, Snowbird, Utah, United States
	P. Wadler, Views: a way for pattern matching to cohabit with data abstraction, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.307-313, January 21-23, 1987, Munich, West Germany
	Lennart Augustsson, A compiler for lazy ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.218-227, August 06-08, 1984, Austin, Texas, United States
	R. C. Sekar , Prateek Mishra , I. V. Ramakrishnan, On the power and limitation of strictness analysis based on abstract interpretation, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.37-48, January 21-23, 1991, Orlando, Florida, United States
	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
	Kenneth R. Traub, Compilation as partitioning: a new approach to compiling non-strict functional languages, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.75-88, September 11-13, 1989, Imperial College, London, United Kingdom
	Paul Hudak , Jonathan Young, Higher-order strictness analysis in untyped lambda calculus, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-109, January 01, 1986, St. Petersburg Beach, Florida
	M. Montenyohl , M. Wand, Correct flow analysis in continuation semantics, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.204-218, January 10-13, 1988, San Diego, California, United States
	Thomas Johnsson, Efficient compilation of lazy evaluation, ACM SIGPLAN Notices, v.39 n.4, April 2004
	Guy Argo, Improving the three instruction machine, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.100-115, September 11-13, 1989, Imperial College, London, United Kingdom
	Jon Fairbairn , Stuart C. Wray, Code generation techniques for functional languages, Proceedings of the 1986 ACM conference on LISP and functional programming, p.94-104, August 1986, Cambridge, Massachusetts, United States
	M. Lemaître , M. Castan , M.-H. Durand , G. Durrieu , B. Lecussan, Mechanisms for efficient multiprocessor combinator reduction, Proceedings of the 1986 ACM conference on LISP and functional programming, p.113-121, August 1986, Cambridge, Massachusetts, United States
	Paul Hudak , Adrienne Bloss, The aggregate update problem in functional programming systems, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.300-314, January 14-16, 1985, New Orleans, Louisiana, United States