DMCA
Correct Higher-Order Program Transformations (1994)
| Venue: | Ph.D. thesis, Northeastern Univ |
BibTeX
@TECHREPORT{The94correcthigher-order,
author = {Of The and Paul A. Steckler},
title = {Correct Higher-Order Program Transformations},
institution = {Ph.D. thesis, Northeastern Univ},
year = {1994}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present a method for proving the correctness of compiler optimizations for higher-order programming languages. Programs are annotated with propositions derived as the solutions to dataflow constraints formulated as local consistency conditions for each parse tree node. We can prove that any such solution yields sound annotations, that is, the propositions are true. Each compiler optimization is presented as a source-to-source transformation. Using the annotations and additional constraint information, we can prove that the optimization is correct with respect to some criterion. The correctness criterion is similar for each transformation. The particular optimizations we exhibit are selective and lightweight closure conversion (constructing source-level closures for procedures, with two variations), Ultra-fi (a generalization of copy propagation to higher-order languages), and selective thunkification (transforming call-by-name programs into callby -value equivalents). iii Acknowle...
Keyphrases
correct higher-order program transformation compiler optimization solution yield sound annotation correctness criterion copy propagation selective thunkification lightweight closure conversion local consistency condition iii acknowle higher-order language parse tree node callby value equivalent source-to-source transformation additional constraint information higher-order programming language call-by-name program particular optimization source-level closure
