A general criterion for avoiding infinite unfolding during partial deduction

Plugging in a depth-bound-free local control strategy yields a fully automatic, concrete partial-deduction method that always terminates and produces precise and reasonable polyvariance, without resorting to ad hoc techniques.

“Plugging in a depth-bound-free local control strategy (see Bruynooghe et al. [1992] and Martens and De Schreye [1996]), we thus obtain a fully automatic, concrete partial-deduction method that always terminates and produces precise and reasonable polyvariance, without resorting to any ad hoc techniques.”

Partial evaluation of ITE-Prolog can be situated somewhere between partial deduction of pure logic programs and partial evaluation of full Prolog.

“In summary, partial evaluation of ITE-Prolog, can be situated somewhere between partial deduction of pure logic programs (see [60,31,10,69,68] and systems like sP [30,29], sAGE [34,33] or more recently ECCE [50,51,57]) and partial evaluation of full Prolog (e.g. MIXTUs [83,82] or PADDY [76–78]).”