1712 search results - page 37 / 343 » Abstract Constraint Data Types |
188
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper introduces a generalization of the nvalue constraint that bounds the number of distinct values taken by a set of variables.The generalized constraint (called n...
106
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
96
Voted
MST
2008
15 years 15 days ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
86
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
105
Voted
ICFP
2006
ACM
16 years 15 days ago
2006
ACM
Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class...