The CLP(R) Language and System

Abstract

The CLPR programming language is defined, its underlyingphilosophy and programming methodology are discussed, importantimplementation issues are explored in detail, and finally, a prototypeinterpreter is described. CLPR is designed to be an instance of the Constraint LogicProgramming Scheme, a family of rule-based constraint programminglanguages defined by Jaffar and Lassez. The domain of computation R of this particular instance is the algebraic structureconsisting of uninterpreted functors over real numbers. An importantproperty of CLP R is that the constraints are treated uniformly in thesense that they are used to specify the input parameters to a program,they are the only primitives use..