9595 search results - page 260 / 1919 » Functional programming in C |
158
click to vote
IFL
1997
Springer
15 years 10 months ago
1997
Springer
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
270
click to vote
GPEM
2011
15 years 1 months ago
2011
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an appropr...
194
click to vote
ICFP
2012
ACM
13 years 8 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
166
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
152
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We had claimed that arc-consistency is preserved in a constraint reformulation relying on functional dependencies (Theorem 2 of [2]). We show that the statement of this t...