Some of these solvers have been integrated into a programming language, thus defining a new programming paradigm called constraint programming: to solve a CSP with constraint programming language
, it is sufficient to specify constraints; their resolution is supported automatically (without needing a program) by constraint solvers integrated language.
SET provides a very general framework for adding sets to a constraint programming language
. In particular, SET can be immediately exploited to obtain a specific instance of the general Constraint Logic Programming (CLP) scheme [Jaffar and Maher 1994].
For example, a video-game animation syntax for a concurrent constraint programming language
 is presented in this article.
More generally, the proof theory defined for CCP can be applied to CLP with dynamic scheduling by translating the latter into a concurrent constraint programming language
which we call [Delta]-CCP and which is basically an extension of CCP with local choice.
One of the most promising innovations in recent programming language design are constraint programming languages and, in particular, constraint logic programming (CLP) languages which combine constraints with logic programming (e.g., see Marriott and Stuckey ).
Although some details of the optimizations and compiler design are specific to CLP(R), we believe the general ideas behind the optimizations and compiler design are applicable to any CLP language and also to other constraint programming paradigms such as concurrent constraint programming languages, constraint databases, constraint imperative languages, and constraint functional languages.
Vijay Saraswat has won the 1989 ACM Doctoral Dissertation Award for his thesis, Concurrent Constraint Programming Languages
. Saraswat received his Ph.D.
Constraint Programming Languages
: Their Specification and Generation.