700 search results - page 101 / 140 » On Termination of Constraint Logic Programs |
103
click to vote
POPL
2011
ACM
14 years 1 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
109
click to vote
OOPSLA
2005
Springer
15 years 4 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
104
click to vote
PPDP
2004
Springer
15 years 4 months ago
2004
Springer
Semi-naive evaluation is an effective technique employed in bottom-up evaluation of logic programs to avoid redundant joins of answers. The impact of this technique on top-down e...
79
Voted
AAECC
1999
Springer
14 years 10 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
VTS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract: An optimization algorithm for the design of combinational circuits that are robust to single-event upsets (SEUs) is described. A simple, highly accurate model for the SEU...