811 search results - page 26 / 163 » Refactoring Using Type Constraints |
COMSIS
2006
13 years 8 months ago
2006
Traditional knowledge representations were developed to encode complete, explicit and executable programs, a goal that makes them less than ideal for representing the incomplete an...
FLAIRS
2008
13 years 9 months ago
2008
This paper describes an algorithm developed as a decision support system for SMT line operators and its purpose is to suggest changes in an existing feeder setup in order to impro...
FASE
2010
Springer
14 years 1 months ago
2010
Springer
Software design models are routinely adapted to domains, companies, and applications. This requires customizable consistency checkers that allow engineers to dynamically adapt mode...
FLAIRS
2008
13 years 11 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
ICFP
2010
ACM
13 years 9 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...