Sciweavers

Share
POPL
2009
ACM

Positive supercompilation for a higher order call-by-value language

12 years 7 months ago
Positive supercompilation for a higher order call-by-value language
Previous deforestation and supercompilation algorithms may introduce accidental termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behavior of a program depending on whether it is optimized or not. We present a supercompilation algorithm for a higher-order call-by-value language and we prove that the algorithm both terminates and preserves termination properties. This algorithm utilizes strictness information for deciding whether to substitute or not and compares favorably with previous call-by-name transformations. Categories and Subject Descriptors D.3.4 [Programming Languages]: Processors ? Compilers, Optimization; D.3.2 [Programming Languages]: Language Classifications ? Applicative (functional) languages General Terms Languages, Theory Keywords supercompilation, deforestation, call-by-value
Peter A. Jonsson, Johan Nordlander
Added 22 Nov 2009
Updated 22 Nov 2009
Type Conference
Year 2009
Where POPL
Authors Peter A. Jonsson, Johan Nordlander
Comments (0)
books