Specialization with clause splitting for deriving deterministic constraint logic programs

Abstract — The reduction of nondeterminism can increase efficiency when specializing programs. We consider constraint logic programs and we propose a technique which by making use of a new transforma-tion rule, called clause splitting, allows us to generate efficient, specialized programs which are determinis-tic. We have applied our technique to the specializa-tion of pattern matching programs