232 search results - page 34 / 47 » Implementing logical connectives in constraint programming |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
ENTCS
2008
13 years 7 months ago
2008
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new ...