348 search results - page 24 / 70 » Using Case-Based Reasoning to Write Constraint Programs |
120
click to vote
ICFP
2008
ACM
16 years 1 months ago
2008
ACM
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
ICLP
1992
Springer
15 years 5 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
119
click to vote
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
109
click to vote
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integri...
108
click to vote
FASE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...