Fast and effective procedure inlining

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

Volumn 1302 LNCS, Issue , 1997, Pages 35-52

  Waddell, Oscar ^a   Kent Dybvig, R ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR TRANSFORMATIONS; STATIC ANALYSIS;

DEMAND-DRIVEN; HIGHER-ORDER LANGUAGES; INLINING; LINEAR TIME; PERFORMANCE GAIN; SIMPLE ANALYSIS;

MATHEMATICAL TRANSFORMATIONS;

EID: 84964360180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032732     Document Type: Conference Paper

References (10)

1. Andrew W. Appel. Compiling with Continuations. Cambridge University Press, 1992.
2. Andrew W. Appel and Trevor Jim. Shrinking lambda expressions in linear time. To appear in Journal of Functional Programming.
3. J. Michael Ashley. A practical and flexible flow analysis for higher-order languages. In Proceedings of the A CM Symposium on Principles of Programming Languages, pages 184-194, 1996.
4. J. Michael Ashley. The effectiveness of flow analysis for inlining. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, 1997. To appear.
5. J. Eugene Ball. Predicting the effects of optimization on a procedure body. SIGPLAN Notices, 14(8):214-220, August 1979. Proceedings of the ACM SIGPLAN '79 Symposium on Compiler Construction.
6. R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K Zadeck. Efficiently computing static single assignment form and the control dependence graph. Technical Report RC 14756, IBM, 1991.
7. Jeffrey Dean and Craig Chambers. Towards better inlining decisions using inlining trials. In Proceedings of the i994 ACM Conference on LISP and Functional Programming, pages 273-282, 1994.
8. Suresh Jagannathan and Andrew Wright. Flow-directed inlining. In Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 193-205, 1996.
9. Oscar Waddell and R. Kent Dybvig. Fast and effective procedure inlining. Technical Report 484, Indiana University Computer Science Department, Lindley Hall 101, Bloomington Indiana, 47405, 1997.
10. M.N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 3(2):181-210, 1991.