Flow-directed closure conversion for typed languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1782, Issue , 2000, Pages 56-71

  Cejtin, Henry ^a   Agannathan, Suresh ^b   Weeks, Stephen ^c  

^a Entertainment Decisions

^b NEC CORPORATION   (Japan)

^c Intertrust STAR Laboratories

Author keywords

[No Author keywords available]

Indexed keywords

TRANSLATION (LANGUAGES);

CLOSURE CONVERSION; COMPILE TIME; FIRST-ORDER LANGUAGE; FLOW ANALYSIS; FUNCTIONAL LANGUAGES; REAL WORLD PROJECTS; TARGET LANGUAGE; TYPE CORRECTNESS;

PROGRAM COMPILERS;

EID: 84947262674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_4     Document Type: Conference Paper

References (26)

1. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992.
2. J. Michael Ashley. A practical and flexible flow analysis for higher-order languages. In ACM Symposium on Principles of Programming Languages, pages 195-207, January 1996.
3. Je_rey M. Bell, Fran_coise Bellegarde, and James Hook. Type-driven defunctionalization. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 25-37, Amsterdam, The Netherlands, 9-11 June 1997.
4. Greg Defouw, David Grove, and Craig Chambers. Fast interprocedural class analysis. In ACM Symposium on Principles of Programming Languages, pages 222-236, January 1998.
5. Allyn Dimock, Robert Muller, Franklyn Turback, and J.B. Wells. Strongly-typed flow-directed representation transformations. In International Conference on Functional Programming, June 1997.
6. Matrin Elsman. Static interpretation of modules. In International Conference on Functional Programming, September 1999.
7. Marc Feeley, James Miller, Guillermo Rozas, and Jason Wilson. Compiling higherorder languages into fully tail-recursive portable c. Technical Report Technical Report 1078, Department of Computer Science, University of Montreal, 1997.
8. Robert Harper and John C. Mitchell. On the type structure of Standard ML. ACM Transactions on Programming Languages and Systems, 15(2):211-252, April 1993.
9. Nevin Heintze. Set-based analysis of ML programs. In ACM Conference on LISP and Functional Programming, pages 306-317, 1994.
10. Nevin Heintze and David A. McAllester. Linear-time subtransitive control flow analysis. In Proceedings of the ACM SIGPLAN'97 Conference on Programming Language Design and Implementation (PLDI), pages 261-272, Las Vegas, Nevada, 15-18 June 1997. SIGPLAN Notices 32(5), May 1997.
11. Fritz Henglein. Simple closure analysis. Technical Report D-193, Department of Computer Science, University of Copenhagen, March 1992.
12. Suresh Jagannathan, Stephen T. Weeks, and Andrew K. Wright. Type-directed flow analysis for typed intermediate languages. In International Static Analysis Symposium, September 1997.
13. Neil D. Jones and Stephen S. Muchnick. Flow Analysis and Optimization of LISPlike Structures, chapter 4, pages 102-131. Prentice-Hall, 1981.
14. Simon L. Peyton Jones, John Launchbury, Mark Shields, and Andrew Tolmach. Bridging the gulf: a common intermediate language for ML and Haskell. In ACM Symposium on Principles of Programming Languages, pages 49-51, January 1998.
15. Robin Milner, Mads Tofte, Robert Harper, and David B. Macqueen. The Definition of Standard ML (Revised). MIT Press, 1997.
16. Yasuhiko Minamide, J. Gregory Morrisett, and Robert Harper. Typed closure conversion. In ACM Symposium on Principles of Programming Languages, pages 271-283, St. Petersburg, FL, January 1996.
17. Jens Palsberg. Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems, 17(1):47-62, January 1995.
18. Jens Palsberg and Patrick O'Keefe. A type system equivalent to flow analysis. ACM Transactions on Programming Languages and Systems, 17(4):576-599, July 1995. Preliminary version in Principles of Programming Languages, pages 367-378, January 1995.
19. John C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM Annual Conference, pages 717-740, 1972.
20. Manuel Serrano and Pierre Weis. 1 + 1 = 1: an optimizing Caml compiler. In Workshop on ML and its applications, Orlando, Florida, June 1994. ACM SIGPLAN. Also appears as INRIA RR-2301.
21. Zhong Shao and Andrew W. Appel. Space-effcient closure representations. In ACM Conference on LISP and Functional Programming, pages 150-161, Orlando, FL, Jun 1994.
22. David Tarditi, Anurag Acharya, and Peter Lee. No assembly required: Compiling Standard ML to C. ACM Letters on Programming Languages and Systems, June 1992. Appears as CMU-CS-90-187.
23. David Tarditi, J. Gregory Morrisett, Perry Cheng, Chris Stone, Robert Harper, and Peter Lee. TIL: A type-directed optimizing compiler for ML. In ACM Conference on Programming Language Design and Implementation, May 1996.
24. Mads Tofte and Lars Birkedal. A region inference algorithm. Transactions on Programming Languages and Systems, 20(4):724-767, 1998.
25. Mads Tofte, Lars Birkedal, Martin Elsman, Niels Hallenberg, Tommy Olesen, Peter Sestoft, and Peter Bertelsen. Programming with regions in the ML Kit. Technical Report Technical Report DIKU-TR-97/12, Department of Computer Science, University of Copenhagen, 1997.
26. Andrew Tolmach and Dino Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. Journal of Functional Programming, 8(4):367-412, July 1998.