4835 search results - page 120 / 967 » Refactoring Functional Programs |
IFL
1997
Springer
15 years 2 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...
148
click to vote
GPEM
2011
14 years 4 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...
107
click to vote
ICFP
2012
ACM
13 years 9 days 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...
104
click to vote
UC
2009
Springer
15 years 4 months ago
2009
Springer
We present a logical approach to the separability analysis issue for a functional quantum computation language. This logic is inspired by previous works on logical analysis of alia...
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...