Towards automatic construction of staged compilers

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 113-125

  Philipose, Matthai ^a   Chambers, Craig ^a   Eggers, Susan J ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; PLANNING; SYSTEMS ANALYSIS;

PROGRAM OPTIMIZATION; STAGED COMPILATION FRAMEWORK;

PROGRAM COMPILERS;

EID: 0036036549     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503284     Document Type: Conference Paper

References (33)

1. Static type inference in a dynamically typed language
2. Implementing regular tree expressions
3. Implementing regular tree expressions
4. Dynamo: A transparent runtime optimization system
5. Whole-program optimization of object-oriented languages
6. From interpreting to compiling binding times
7. A general approach for run-time specialization and its application to C
8. Vortex: An optimizing compiler for object-oriented languages
9. Simple and effective analysis of statically-typed object-oriented programs
10. Simple and effective link-time optimization of modula-3 programs
11. Marmot: An optimizing compiler for Java
12. An automatic program generator for multi-level specialization
13. Annotation-directed run-time specialization in C
14. An evaluation of staged, run-time optimizations in DyC
15. Fiat: A framework for interprocedural analysis and transformation
16. Set-based analysis of ML programs
17. Finiteness analysis
18. Optimizing dynamically-dispatched calls with run-time type feedback
19. Flow analysis and optimization of lisp-like structures
20. Optimizing ML with run-time code generation
21. Eliminating dead code on recursive data
22. Efficient incremental run-time specialization for free
23. Automatic, template-based run-time specialization: Implementation and experimental study
24. Optimizing an ANSI C interpreter with superoperators
25. Program specialization via program slicing
26. Automatic computation of data set definitions
27. Two for the price of one: Composing partial evaluation and compilation
28. Practical experience with an application extractor for Java
29. Deforestation: Transforming programs to eliminate trees
30. Automatic online partial evaluation