Some Global Compile-Time Optimizations for CLP(R)

Generation of eecient code for constraint logic programming (CLP) languages poses new problems. It is not yet clear which techniques from Prolog compilation will be important nor what sort of domain speciic techniques can be developed. As a case study, we describe and evaluate four global optimizations for use in the compilation of the language CLP(R). The rst three are variants of optimizations used in Prolog compilation. The fourth is novel, and is based on nding constraints which are \future redundant" in the sense that at some point in the future they will be implied by other constraints. Finally, we give evidence in the form of preliminary tests that these optimizations can signiicantly improve performance.