Optimizing nested loops using local CPS conversion

Higher-Order and Symbolic Computation

Volumn 15, Issue 2-3, 2002, Pages 161-180

  Reppy, John ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Compiling functional languages; Continuation passing style; CPS; Direct style representation

Indexed keywords

CODE CONVERTERS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION;

CONTINUATION-PASSING STYLE (CPS);

PROGRAM COMPILERS;

EID: 0036762196     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1020839128338     Document Type: Article

References (34)

1. Appel, A.W. Compiling with Continuations. Cambridge University Press, New York, NY, 1992.
2. Appel, A.W. and Jim, T. Shrinking lambda expressions in linear time. Journal of Functional Programming, 7(4) (1997) 515-540.
3. Benton, N., Kennedy, A., and Russell, G. Compiling standard ML to Java bytecodes. In Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, 1998, pp. 129-140.
4. Damian, D. and Danvy, O. Syntactic accidents in program analysis: On the impact of the CPS transformation. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, 2000, pp. 209-220.
5. Danvy, O. and Hatcliff, J. CPS transformation after strictness analysis. ACM Letters on Programming Languages and Systems, 1(3) (1992) 195-212.
6. Fisher, K. and Reppy, J. The design of a class mechanism for Moby. In Proceedings of the SIGPLAN'99 Conference on Programming Language Design and Implementation, 1999, pp. 37-49.
7. Fisher, K. and Reppy, J. Compiler support for lightweight concurrency. Available from www.cs.bell-labs.com/̃jhr/moby. Also submitted for publication.
8. Flanagan, C., Sabry, A., Duba, B.F., and Felleisen, M. The essence of compiling with continuations. In Proceedings of the SIGPLAN'93 Conference on Programming Language Design and Implementation, 1993, pp. 237-247.
9. Fluet, M. and Weeks, S. Contification using dominators. In Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming, 2001, pp. 2-13.
10. George, L. and Appel, A. Iterated register coalescing. ACM Transactions on Programming Languages and Systems, 18(3) (1996) 300-324.
11. George, L., Guillaume, F., and Reppy, J. A portable and optimizing back end for the SML/NJ compiler. In Fifth International Conference on Compiler Construction, 1994, pp. 83-97.
12. Johnsson, T. Lambda-lifting: Transforming programs to recursive equations. In Functional Programming Languages and Computer Architecture, 1985, pp. 190-203.
13. Kelsey, R. and Hudak, P. Realistic compilation by program transformation. In Conference Record of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 281-292.
14. Kelsey, R.A. A correspondence between continuation passing style and static single assignment form. In Proceedings of the ACM SIGPLAN Workshop on Intermediate Representations, 1995, pp. 13-22.
15. Kim, J. and Yi, K. Interconnecting between CPS terms and non-CPS terms. In Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01), A. Sabry (Ed.). Technical Report 545, Computer Science Department, Indiana University, 2001, pp. 7-16.
16. Kim, J., Yi, K., and Danvy, O. Assessing the overhead of ML exceptions by selective CPS transformation, In Proceedings of the 1998 ACM SIGPLAN Workshop on ML, 1998, pp. 103-114.
17. Kranz, D., Kelsey, R., Rees, J., Hudak, P., Philbin, J., and Adams, N. Orbit: An optimizing compiler for Scheme. In Proceedings of the SIGPLAN'86 Symposium on Compiler Construction, 1986, pp. 219-233.
18. Leroy, X. The effectiveness of type-based unboxing. In ACM SIGPLAN Workshop on Types in Compilation (TIC97), 1997. Available as Technical report BCCS-97-03, Boston College, Computer Science Department.
19. Leroy, X. The Objective Caml System (release 3.00), 2000. Available from http://caml.inria.fr.
20. Moggi, E. Notions of computation and monads. Information and Computation, 93(1) (1991) 55-92.
21. Nielsen, L.R. A selective CPS transformation. In Electronic Notes in Theoretical Computer Science, edited by S. Brooks and M. Mislove, Vol. 45, 2001. Also available as BRICS Report RS-01-30.
22. Nielson, F., Nielson, H.R., and Hankin, C. Principles of Program Analysis. Springer-Verlag, New York, NY, 1999.
23. Oliva, D.P. and Tolmach, A.P. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4) (1998) 367-412.
24. Reppy, J. Local CPS conversion in a direct-style compiler. In Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01), A. Sabry (Ed.). Technical Report 545, Computer Science Department, Indiana University, 2001, pp. 13-22.
25. Sabry, A. (Ed.). Proceedings of the Third ACM SIGPLAN Workshop on Continuations (CW'01) (2001). Technical Report 545, Computer Science Department, Indiana University, London, England.
26. Sabry, A. and Felleisen, M. Is continuation-passing style useful for data flow analysis? In Proceedings of the SIGPLAN'94 Conference on Programming Language Design and Implementation, 1994, pp. 1-12.
27. Shao, Z. and Appel, A.W. Space-efficient closure representations. In Conference Record of the 1994 ACM Conference on Lisp and Functional Programming, 1994, pp. 150-161.
28. Shao, Z., Reppy, J.H., and Appel, A.W. Unrolling lists. In Conference Record of the 1994 ACM Conference on Lisp and Functional Programming, 1994, pp. 185-191.
29. Shivers, O. Control-flow analysis of higher-order languages or taming lambda. Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. Available as Technical Report CMU-CS-91-145, 1991.
30. Steckler, P.A. and Wand, M. Lightweight closure conversion. ACM Transactions on Programming Languages and Systems, 19(1) (1997) 48-86.
31. Steele, Jr., G.L. LAMBDA: The ultimate declarative. Technical Report AI Memo 379, Massachusetts Institute Technology, Artificial Intelligence Laboratory, 1976.
32. Steele, G.L., Jr. Rabbit: A compiler for Scheme. Master's thesis, Massachusetts Institute Technology, Artificial Intelligence Laboratory. MIT AI Memo 474, 1978.
33. Tarditi, D. Design and implementation of code optimizations for a type-directed compiler for Standard ML. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA. Available as Technical Report CMU-CS-97-108, 1996.
34. Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., and Lee, P. TIL: A type-directed optimizing compiler for ML. In Proceedings of the SIGPLAN'96 Conference on Programming Language Design and Implementation, 1996, pp. 181-192.