Previous deforestation and supercompilation algorithms may in-troduce accidental termination when applied to call-by-value pro-grams. This hides looping bugs from the programmer, and changesthe behavior of a program depending on whether it is optimizedor not. We present a supercompilation algorithm for a higher-ordercall-by-value language and we prove that the algorithm both termi-nates and preserves termination properties. This algorithm utilizesstrictness information for deciding whether to substitute or not andcompares favorably with previous call-by-name transformations.
展开▼
