Constrained partial deduction
Michaël Leuschel, Danny De Schreye · Lirias · 1997
Partial deduction based upon the Lloyd and Shepherdson framework generates a specialised program given a set of atoms. Each such atom represents all its instances. This can severely limit the specialisation potential of partial deduction. We therefore extend the precision the Lloyd and Shepherdson approach by integrating ideas from constraint logic programming. We formally prove correctness of this new framework of constrained partial deduction and illustrate its potential on some examples. 1 Partial Deduction In contrast to ordinary (full) evaluation, a partial evaluator is given a program P along with only part of its input, called the static input. The remaining part of the input, called the dynamic input , will only be known at some later point in time. Given the static input S, the partial evaluator then produces a specialised version P S of P which, when given the dynamic input D, produces the same output as the original program P . The goal is to exploit the static input in or...