Reducing nondeterminism while specializing logic programs

Program specialization is a collection of program transformation techniques for improving program efficiency by exploiting some information available at compile-time about the input data. This work shows that current techniques for program specialization based on partial evaluation do not perform well on nondeterministic logic programs. Following this, a set of transformation rules which extend the ones used for partial evaluation is considered. Finally, a strategy is proposed to direct the application of these extended rules to derive very efficient specialized programs.