Recursion is more efficient than iteration

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Recursion is more efficient than iteration

Full text

Pdf (380 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents

Austin, Texas, United States

Pages: 228 - 234

Year of Publication: 1984

ISBN:0-89791-142-3

Author

Emmanuel Saint-James

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): 10, Downloads (12 Months): 38, Citation Count: 8

Additional Information:

references cited by index terms

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/800055.802039 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	Auslander Systematic Recursion Removal IBM Thomas J. Watson Center RC 5841 2/5/1976.
	2	R. S. Bird, Notes on recursion elimination, Communications of the ACM, v.20 n.6, p.434-439, June 1977 [doi>10.1145/359605.359630]
	3	Chailloux Le modele VLisp: description, implementation, description These de 3éme cycle Université Paris 6 Avril 1980.
	4	Chailloux Le_Lisp 80: Manuel de Reference Inria Mai 1983.
	5	Darlington A system which automatically improves programs Acta Informatica Vol 6 1976.
	6	Goldschlager Recursion in small storage Software Practice & Experience Vol 11 N 7 July 1981.
	7	Greussay Iterative Interpretation of Tail-Recursive Lisp Procedures TR 20-76 Université de Paris 8 Vincennes Septembre 1976.
	8	Greussay Contribution a la definition interpretative et a l'implementation des lambda-languages These de Doctorat d'Etat Universite Paris 7 Nov.77
	9	Huet & Lang Proving and applying Program Transformations Expressed with Second Order Patterns Acta Informatica Vol 11 1978.
	10	Theodore D. Lassagne, Recursive definitions for iterative algorithms, ACM SIGPLAN Notices, v.10 n.12, December 1975 [doi>10.1145/987686.987690]
	11	Risch A program for automatic recursion removal in Lisp Uppsala Universitet 1973.
	12	Rohl Converting a class of recursive procedures into non-recursives ones Software Practice & Experience Vol 7 1978.
	13	Saint-James Elimination dynamique des environnements perimes To appear.
	14	Guy L Steele, LAMBDA: The Ultimate Declarative, Massachusetts Institute of Technology, Cambridge, MA, 1976
	15	Guy L Steele , Gerald J Sussman, Lambda: The Ultimate Imperative, Massachusetts Institute of Technology, Cambridge, MA, 1976
	16	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 8

	S. K. Debray, Unfold/fold transformations and loop optimization of logic programs, ACM SIGPLAN Notices, v.23 n.7, p.297-307, July 1988
	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
	Jérome Chailloux , Ma´thieu Devin , Jean-Marie Hullot, LELISP, a portable and efficient LISP system, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.113-122, August 06-08, 1984, Austin, Texas, United States
	R. Beckmann , K.-U. Felgentreu, The impact of the LCC-optimization on the performance of a static scope LISP interpreter, Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES, p.146-160, May 04-06, 1988, Cannes, France
	M Furnari, Pascal implementation of a LISP interpreter, ACM SIGPLAN Notices, v.22 n.5, p.42-46, May 1987
	Christian Queinnec, Continuation conscious compilation, ACM SIGPLAN Lisp Pointers, v.VI n.1, p.2-14, Jan.-March 1993
	O. Danvy, Memory allocation and higher-order functions, ACM SIGPLAN Notices, v.22 n.7, p.241-252, July 1987
	Luc Moreau, A Syntactic Theory of Dynamic Binding, Higher-Order and Symbolic Computation, v.11 n.3, p.233-279, 1998