Return value placement and tail call optimization in high level languages

Journal of Logic Programming

Volumn 38, Issue 1, 1999, Pages 1-29

  Bigot, Peter A ^a   Debray, Saumya ^a  

^a University of Arizona   (United States)

Author keywords

Implementation; Optimization; Tail call

Indexed keywords

DATA STORAGE EQUIPMENT; LOGIC PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER); SUBROUTINES;

RAIL CALL OPTIMIZATION; RETURN VALUE PLACEMENT;

HIGH LEVEL LANGUAGES;

EID: 0032711589     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(98)80001-0     Document Type: Article

References (23)

1. A.W. Appel, Compiling with Continuations, Cambridge Univ. Press, Cambridge, 1992.
2. A.W. Appel, Z. Shao, Callee-save registers in continuation-passing style. Lisp and Symbolic Computation 5 (1992) 191-221.
3. J.M. Ashley, R.K. Dybvig, An efficient implementation of multiple return values in scheme, in: Proceedings of ACM Conference on Lisp and Functional Programming, 1994, pp. 140-149.
4. J. Beer, The occur-check problem revisited, J. Logic Programming 5 (3) (1988) 243-261.
5. P.A. Bigot, D. Gudemun, S.K. Debray, Output value placement in moded logic programs, Technical Report 94-03, Department of Computer Science, The University of Arizona, Tucson (1994).
6. R.A. Brooks, R.P. Gabriel, G.L. Steele, Jr., S-I common Lisp implementation, in: Proceedings of ACM Symposium on Lisp and Functional Programming, Pittsburgh, PA, August 1982, pp. 108-113.
7. P. Cheng, C. Okasaki, Destination-passing style and generational garbage collection, Unpublished manuscript, School of Computer Science, Carnegie Mellon University, Pittsburgh (1996).
8. W. D. Clinger, L.T. Hansen, Lambda, the ultimate label, or a simple optimizing compiler for scheme, in: Proceedings of ACM Conference on Lisp and Functional Programming, 1994, pp. 128-139.
9. S.K. Debray, D. Gudeman, P.A. Bigot, Detection and optimization of suspension-free logic programs, J. Logic Programming (Special Issue on High Performance Implementations) 29 (1-3) (1996) 171-194.
10. D. Gudeman, K. De Bosschere, S.K. Debray, jc: An efficient and portable sequential implementation of Janus, in: Proceedings of Joint International Conference and Symposium on Logic Programming, Washington, DC, MIT Press, Cambridge, MA, November 1992, pp. 399-413.
11. D. Krantz, ORBIT. An Optimizing Compiler for Scheme, Ph.D. Dissertation, Yale University (1988); also available as Technical Report YALEU/DCS/RR-632, Dept. of Computer Science, Yale University (1988).
12. D. Krantz, ORBIT. An Optimizing Compiler for Scheme, Ph.D. Dissertation, Yale University (1988); also available as Technical Report YALEU/DCS/RR-632, Dept. of Computer Science, Yale University (1988).
13. J.R. Larus, Restructuring symbolic programs for concurrent execution on multiprocessors, Ph.D. Dissertation, University of California, Berkeley (1989); also available as Technical Report UCB/CSD 89/502, Computer Science Division (EECS), University of California, Berkeley (1989).
14. J.R. Larus, Restructuring symbolic programs for concurrent execution on multiprocessors, Ph.D. Dissertation, University of California, Berkeley (1989); also available as Technical Report UCB/CSD 89/502, Computer Science Division (EECS), University of California, Berkeley (1989).
15. W.H. Press, S.A. Teukolsky, W.T. Vetterling, B.P. Flannery, Numerical Recipes in C, Cambridge Univ. Press, Cambridge, 1992.
16. N. Röjemo, Generational garbage collection for lazy functional languages with temporary space leaks, in: Proceedings of International Workshop on Memory Management, Springer, Berlin, 1995.
17. P.A. Steenkiste, J.L. Hennessy, A simple interprocedural register allocation algorithm and its effectiveness for Lisp, ACM Trans. Programming Languages and Systems 11 (1) (1989) 1-32.
18. D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, P. Lee, TIL: A type-directed optimizing compiler for ML, in: Proceedings of SIGPLAN '96 Conference on Programming Language Design and Implementation, ACM, New York, 1996, pp. 181-192.
19. E. Tick, Parallel Logic Programming, MIT Press, Cambridge, MA, 1991.
20. P. Van Roy, Can logic programming execute as fast as imperative programming?, Ph.D. Thesis, University of California at Berkeley (1990).
21. P. Wadler, Listlessness is better than laziness: Lazy evaluation and garbage collection at compiletime, in: Proceedings of ACM Symposium on Lisp and Functional Programming, 1984, pp. 45-52.
22. D.W. Wall, Predicting program behavior using real or estimated profiles, in: Proceedings of SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991, pp. 59-70.
23. D.H.D. Warren, An abstract Prolog instruction set. Technical Note 309, SRI International, Menlo Park, CA (1983).