Positive Supercompilation for a higher order call-by-value language (2007)
| Venue: | In Proc. IFL 2007 |
| Citations: | 10 - 1 self |
BibTeX
@INPROCEEDINGS{Jonsson07positivesupercompilation,
author = {Peter A. Jonsson and Johan Nordl},
title = {Positive Supercompilation for a higher order call-by-value language},
booktitle = {In Proc. IFL 2007},
year = {2007}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Previous deforestation and supercompilation algorithms may introduce termination when applied to call-by-value programs. This hides looping bugs from the programmer, and changes the behaviour of a program depending on whether it is optimized or not. We present a supercompilation algorithm for a higher-order call-by-value language that preserves termination properties. This algorithm utilizes strictness information for deciding whether to substitute or not and compares favorably with previous call-by-name transformations. 1
