This paper shows how the Improvement Theorem-a semantic condition for the total correctness of program transformation on higher-order functional programs-has practical value in proving the correctness of automatic techniques, including deforestation and supercompilation. This is aided by a novel formulation (and generalisation) of deforestation-like transformations, which also greatly adds to the modularity of the proof with respect to extensions to both the language and the transformation rules.
CITATION STYLE
Sands, D. (1995). Proving the correctness of recursion-based automatic program transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 915, pp. 681–695). Springer Verlag. https://doi.org/10.1007/3-540-59293-8_228
Mendeley helps you to discover research relevant for your work.