An offline approach to narrowing-driven partial evaluation (a partial evaluation scheme for first-order functional and functional logic programs) has recently been introduced. In this approach, program annotations (i.e., the expressions that should be generalised at partial evaluation time to ensure termination) are based on a simple syntactic characterisation of quasi-terminating programs. This work extends the previous offline scheme by introducing a new annotation strategy which is based on a combination of size-change graphs and binding-time analysis. Preliminary experiments point out that the number of program annotations is significantly reduced compared to the previous approach, which means that faster residual programs are often produced. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Arroyo, G., Ramos, J. G., Silva, J., & Vidal, G. (2007). Improving offline narrowing-driven partial evaluation using size-change graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4407 LNCS, pp. 60–76). Springer Verlag. https://doi.org/10.1007/978-3-540-71410-1_6
Mendeley helps you to discover research relevant for your work.