2 research outputs found
Fast Offline Partial Evaluation of Logic Programs
One of the most important challenges in partial evaluation is the design of automatic
methods for ensuring the termination of the process. In this work, we introduce sufficient
conditions for the strong (i.e., independent of a computation rule) termination and quasitermination
of logic programs which rely on the construction of size-change graphs. We
then present a fast binding-time analysis that takes the output of the termination analysis
and annotates logic programs so that partial evaluation terminates. In contrast to previous
approaches, the new binding-time analysis is conceptually simpler and considerably faster,
scaling to medium-sized or even large examples.
© 2014 Elsevier Inc. All rights reserved.This work has been partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2008-06622-C03-02 and by the Generalitat Valenciana under grant PROMETEO/2011/052.Leuschel, M.; Vidal Oriola, GF. (2014). Fast Offline Partial Evaluation of Logic Programs. Information and Computation. 235:70-97. https://doi.org/10.1016/j.ic.2014.01.005S709723