The term for a paradigm related to logic or declarative programming, where information is specified as a constraint on the result, and the evaluator's task is to use this information to limit the search space that some base set of algorithms would ordinarily have traversed to find the answer.

Constraints-based programming languages are not as common as constraints-solving libraries, since in the general case there is no systematically-reliable approach to this kind of evaluation style.

Generally, constraints are an interesting type of annotation.

Pages in this topic: AKL   Goedel   Janus   Kaleidoscope   LIFE   Morphe   NCL   PJ   Screamer   SPARCL  

Also linked from: Actor   Alice   Garnet   Linear Logic Comments   Microkernel Debate   Mozart/Oz   Type Systems Varieties