Proper Tail Recursion and Space Efficiency

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 33, Issue 5, 1998, Pages 174-185

  Clinger, William D ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347507533     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/277652.277719     Document Type: Article

References (41)

1. A. Aiken, M. Fähndrich, and R. Levien. Better static memory management: Improving region-based analysis of higher-order languages. In 1995 Conference on Programming Language Design and Implementation, pages 174-185, San Diego, California, June 1995.
2. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992.
3. Andrew W. Appel and Zhong Shao. An empirical and analytic study of stack vs. heap cost for languages with closures. Journal of Functional Programming, 6(1):47-74, 1996.
4. Hal Abelson and Gerald Jay Sussman with Julie Sussman. Structure and Interpretation of Computer Programs. MIT Press, Cambridge, MA, second edition, 1996.
5. Henry Baker. Cons should not cons its arguments, part II: Cheney on the M.T.A. ACM SIGPLAN Notices, 30(9):17-20, September 1995.
6. Hans-Juergen Boehm. Space-efficient conservative garbage collection. In Proc. 1993 ACM Conference on Programming Language Design and Implementation, pages 197-206, 1993.
7. William D. Clinger and Lars Thomas Hansen. Lambda, the ultimate label, or a simple optimizing compiler for Scheme. In Proc. 1994 ACM Symposium on Lisp and Functional Programming, pages 128-139, 1994.
8. David R. Chase. Safety considerations for storage allocation optimizations. In Proc. 1988 ACM Conference on Programming Language Design and Implementation, pages 1-10, 1988.
9. William Clinger. The Scheme 311 compiler: an exercise in denotational semantics. In Proc. 1984 ACM Symposium on Lisp and Functional Programming, pages 356-364, August 1984.
10. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
11. Christopher W. Fraser and David R. Hanson. A Retargetable C Compiler: Design and Implementation. Benjamin/Cummings, 1995.
12. Michael J. Fischer. Lambda calculus schemata. In Proceedings of the ACM Conference on Proving Assertions about Programs, pages 104-109. ACM SIGPLAN, SIGPLAN Notices, Vol. 7, No 1 and SIGACT News, No 14, January 1972.
13. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In Proc. 1993 ACM Conference on Programming Language Design and Implementation, pages 237-247, 1993.
14. Joshua D. Guttman and Mitchell Wand (editors). VLISP: A Verified Implementation of Scheme. Kluwer, Boston, 1995. Originally published as a special double issue of the journal Lisp and Symbolic Computation (Volume 8, Issue 1/2).
15. Joshua D. Guttman and Mitchell Wand (editors). VLISP: A Verified Implementation of Scheme. Kluwer, Boston, 1995. Originally published as a special double issue of the journal Lisp and Symbolic Computation (Volume 8, Issue 1/2).
16. Chris Hanson. Efficient stack allocation for tail-recursive languages. In Proc. 1990 ACM Symposium on Lisp and Functional Programming, 1990.
17. Carl Hewitt. Viewing control structures as patterns of passing messages. Artificial Intelligence, 8:323-364, 1977.
18. IEEE Computer Society, New York. IEEE Standard for the Scheme Programming Language, IEEE standard 1178-1990 edition, 1991.
19. 5 report on the algorithmic language Scheme. ftp://ftp.nj.nec.com/pub/kelsey/r5rs.ps, February 1998.
20. David A. Kranz, Richard Kelsey, Jonathan A. Rees, Paul Hudak, James Philbin, and Norman I. Adams. Orbit: An optimizing compiler for Scheme. In Proceedings SIGPLAN '86 Symposium on Compiler Construction, 1986. SIGPLAN Notices 21(7), July, 1986, 219-223.
21. Donald A. Knuth. The Art of Programming, Volume 1 / Fundamental Algorithms. Addison-Wesley, Boston, second edition, 1973.
22. Lightship Software. MacScheme Manual and Software. The Scientific Press, 1990.
23. Greg Morrisett, Matthias Felleisen, and Robert Harper. Abstract models of memory management. In Proc. 1995 ACM Conference on Functional Programming and Computer Architecture, pages 66-77, 1995.
24. G. Morrisett and R. Harper. Semantics of memory management for polymorphic languages. In A. D. Gordon and A. M. Pitts, editors, Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 175-226. Cambridge University Press, 1997.
25. Hanne Riis Nielson and Flemming Nielson. Semantics with Applications: a Formal Introduction. John Wiley & Sons, 1992.
26. Christian Queinnec. Lisp in Small Pieces. Cambridge University Press, 1996.
27. John D. Ramsdell. Scheme: the next generation. ACM Lisp Pointers, 7(4):13-14, Oct-Dec 1994.
28. John D. Ramsdell. The tail recursive SECD machine. To appear, 1998.
29. Manuel Serrano. Bigloo user's manual. Part of the Bigloo 1.9 distribution available via http://cuiwww.unige.ch/serrano/bigloo.html, 1997.
30. Manuel Serrano and Marc Feeley. Storage use analysis and its applications. In Proc. 1996 ACM International Conference on Functional Programming, pages 50-61, 1996.
31. Jeffrey Mark Siskind. Stalin - a STAtic Language ImplementatioN. Software available via http://www.neci.nj.nec.com/homepages/qobi/, 1997.
32. Gerald J. Sussman and Guy L. Steele, Jr. Scheme: An interpreter for extended lambda calculus. Artificial Intelligence Memo 349, Massachusetts Institute of Technology, Cambridge, MA, December 1975.
33. Guy L. Steele, Jr. and Gerald Jay Sussman. Lambda: The ultimate imperative. Artificial Intelligence Memo 353, Massachusetts Institute of Technology, Cambridge, MA, March 1976.
34. Guy L. Steele, Jr. and Gerald Jay Sussman. The art of the interpreter or, the modularity complex (parts zero, one and two). Artificial Intelligence Memo 453, Massachusetts Institute of Technology, Cambridge, MA, May 1978.
35. Guy L. Steele, Jr. and Gerald Jay Sussman. The revised report on SCHEME. Artificial Intelligence Memo 452, Massachusetts Institute of Technology, Cambridge, MA, January 1978.
36. Guy L. Steele, Jr. Lambda: The ultimate declarative. Artificial Intelligence Memo 379, Massachusetts Institute of Technology, Cambridge, MA, October 1976.
37. Guy Lewis Steele, Jr. Debunking the "expensive procedure call" myth. In ACM National Conference, pages 153-162, Seattle, October 1977. Revised as MIT AI Memo 443, October 1977.
38. Guy L. Steele, Jr. Rabbit: A compiler for Scheme. Technical Report 474, Massachusetts Institute of Technology, Cambridge, MA, May 1978.
39. Mads Tofte and Jean-Pierre Talpin. Implementation of the typed call-by-value λ-calculus using a stack of regions. In Proceedings 21st Annual ACM Symposium on Principles of Programming Languages, pages 188-201, 1994.
40. Mitchell Wand. Continuation-based program transformation strategies. Journal of the ACM, 27:164-180, 1980.
41. Mitchell Wand and Daniel P. Friedman. Compiling lambda expressions using continuations and factorizations. Journal of Computer Languages, 3:241-263, 1978.