5863 search results - page 475 / 1173 » Calculating Functional Programs |
190
Voted
CP
2003
Springer
16 years 24 days ago
2003
Springer
Abstract. In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which users have preferences. We consider the problem of...
375
click to vote
LICS
1994
IEEE
15 years 11 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
223
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
158
Voted
CORR
2008
Springer
15 years 7 months ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
196
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...