The Category of Constraint Systems is Cartesian-Closed

  title={The Category of Constraint Systems is Cartesian-Closed},
  author={Vijay A. Saraswat},
The development of constraint programming has brought to the forefront the notion of constraint systems as certain first-order systems of partial information [JL87,Sar89,SRP91]. We give a general definition of constraint systems utilizing Gentzen-style sequents. Constraint systems can be regarded as enriching the propositional Scott information systems with manimal first-order structure: the notion of variables, existential quantification and substitution. We take as morphisms approximable maps… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 45 extracted citations

Compiling Constraints in clp(FD)

J. Log. Program. • 1996
View 4 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-6 of 6 references

Concurrency in the A-calculus: Higher-order Concurrent Constraint Programming

Sargl Vijay A. Saraswat
Submitted for publication, • 1991

What is a constraint system

PSSSSl Prakash Panangaden, Vijay Saraswat, Robert Seely, Phil Scott
Submitted for publication, • 1991

Domain Theory in Logical Form

Ann. Pure Appl. Logic • 1987

Domains for denotational semantics

Dana S. Scott
In Proceedings of ICALP, • 1982

Similar Papers

Loading similar papers…