Constraints as a Paradigm for Computing

This dissertation presents a multiple domain constraint logic programming system (MDCLP) in which multiple solvers are supported and are viewed as external modules interfaced to the logic programming system through the set of constructors and predicates they support. The concept of separately compiled modules and a type system are introduced into the logic programming language in order to facilitate the composition of the various solvers into more specialized solvers for composite domains. Multiple language programming is supported by a control protocol based on continuations.