Department of Computer Science and Engineering; Oregon Graduate Institute of Science & Technology
SVM HeaderParse 0.2
20000 N.W. Walker Road P.O. Box 91000; Portland, OR 97291-1000
SVM HeaderParse 0.1
Program fusion techniques have long been proposed as an effective means of improving program performance and of eliminating unnecessary intermediate data structures. This paper proposes a new approach on program fusion that is based entirely on the type signatures of programs. First, for each function, a recursive skeleton is extracted that captures its pattern of recursion. Then, the parametricity theorem of this skeleton is derived, which provides a rule for fusing this function with any function. This method generalizes other approaches that use fixed parametricity theorems to fuse programs. 1 Introduction There is much work recently on using higher-order operators, such as fold  and build [6, 5], to automate program fusion  and deforestation . Even though these methods do a good job on fusing programs, they are only effective if programs are expressed in terms of these operators. This limits their applicability to conventional functional languages. To ameliorate this pro...