Efficient stack allocation for tail-recursive languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient stack allocation for tail-recursive languages

Full text

Pdf (1.14 MB)

Source

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

Nice, France

Pages: 106 - 118

Year of Publication: 1990

ISBN:0-89791-368-X

Author

Chris Hanson

MIT Artificial Intelligence Laboratory

Sponsors

INRIA : Institut Natl de Recherche en Info et en Automatique
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
SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 33, Citation Count: 10

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/91556.91603 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.

	2	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	3	Andrew W. Appel. Garbage Collection can be Faster than Stack Allocation. Princeton University Department of Computer Science CS-TR-045-86, June 1986.
	4	Will Clinger , Anne Hartheimer , Eric Ost, Implementation strategies for continuations, Proceedings of the 1988 ACM conference on LISP and functional programming, p.124-131, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62692]
	5	HP. UX Assembler Reference and Supporting Documents. Hewlett-P~rd Company, Fort Collins, 1988.
	6	CORPORATE MOTOROLA, MC68020 32-BIT microprocessor user's manual, Motorola Inc., Phoenix, AZ, 1991
	7	Simon L. Peyton Jones, The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science), Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	8	Jonathan Rees. Personal communication.
	9	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	10	Jonathan Rees and Guillermo luan Rozas. Personal communication.
	11	Guillermo Juan Rozas. Liar, an Algol-like Compiler }or Scheme. S. B. thesis, MIT Department of Electrical En- ~ineerin$ ~td Computer Science, Januaxy 1984.
	12	Richard M. Stafim~n Using and Porting GNU CC. Free Software Foundation, Inc. Februaxy 1990.
	13	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]

CITED BY 10

	William D. Clinger , Lars Thomas Hansen, Lambda, the ultimate label or a simple optimizing compiler for Scheme, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.128-139, July-Sept. 1994
	Guillermo Juan Rozas, Taming the Y operator, ACM SIGPLAN Lisp Pointers, v.V n.1, p.226-234, Jan. 1992
	Zhong Shao , Andrew W. Appel, Space-efficient closure representations, ACM SIGPLAN Lisp Pointers, v.VII n.3, p.150-161, July-Sept. 1994
	William D. Clinger, Proper tail recursion and space efficiency, ACM SIGPLAN Notices, v.33 n.5, p.174-185, May 1998
	Zhong Shao , Andrew W. Appel, Efficient and safe-for-space closure conversion, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.129-161, Jan. 2000
	Christian Queinnec , Bernard Serpette, A dynamic extent control operator for partial continuations, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.174-184, January 21-23, 1991, Orlando, Florida, United States
	Henry G. Baker, Linear logic and permutation stacks—the Forth shall be first, ACM SIGARCH Computer Architecture News, v.22 n.1, p.34-43, March 1994
	Henry G. Baker, CONS should not CONS its arguments, part II: Cheney on the M.T.A., ACM SIGPLAN Notices, v.30 n.9, p.17-20, Sept. 1995
	Henry G. Baker, Shallow binding makes functional arrays fast, ACM SIGPLAN Notices, v.26 n.8, p.145-147, Aug. 1991
	William D. Clinger , Anne H. Hartheimer , Eric M. Ost, Implementation Strategies for First-Class Continuations, Higher-Order and Symbolic Computation, v.12 n.1, p.7-45, April 1999