3136 search results - page 230 / 628 » Genetic programming theory |
148
click to vote
BIRTHDAY
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. This paper gives a reduction-preserving translation from Coquand's dependent pattern matching [4] into a traditional type theory [11] with universes, inductive types...
117
click to vote
CORR
2008
Springer
15 years 5 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 ...
149
click to vote
CIE
2010
Springer
15 years 10 months ago
2010
Springer
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
170
click to vote
JSC
2010
15 years 4 months ago
2010
Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of nar...
156
click to vote
ICALP
2007
Springer
15 years 12 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...