Meta-programming in CLP(R)

AbstractA widely used property of Prolog is that it is possible to write Prolog programs to construct and manipulate other Prolog programs in a very general manner. Unfortunately, this property is not carried over to richer languages such as CLP(R>)—the manipulation of CLP(R) programs in CLP(R) is quite limited. The reason is that the equality of terms in CLP(R) is not based on their syntactic structure. We propose an extended language, CLP(R + M), in which programs may be represented and structurally manipulated. Importantly, CLP(R + M) is not just a meta-language for CLP(R), but it can also be used as its own meta-language. We present a decision algorithm for (R + M) constraints, discuss implementation issues, and describe the implementation of a subclass of (R + M) constraints. Finally, by building on the extended language, we present an integrated set of system predicates and a methodology for practical meta-programming