Jonsson, Peter A. and Nordlander, Johan - Positive Supercompilation for a Higher-Order Call-By-Value Language

lmcs:1038 - Logical Methods in Computer Science, August 18, 2010, Volume 6, Issue 3
Positive Supercompilation for a Higher-Order Call-By-Value Language

Authors: Jonsson, Peter A. and Nordlander, Johan

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 prove that the algorithm both terminates and preserves termination properties. This algorithm utilizes strictness information to decide whether to substitute or not and compares favorably with previous call-by-name transformations.


Source : oai:arXiv.org:1005.5278
DOI : 10.2168/LMCS-6(3:5)2010
Volume: Volume 6, Issue 3
Published on: August 18, 2010
Submitted on: October 12, 2009
Keywords: Computer Science - Programming Languages,D.3.4,D.3.2


Share

Consultation statistics

This page has been seen 65 times.
This article's PDF has been downloaded 44 times.