Sciweavers

4743 search results - page 102 / 949
» Introduction to Functional Programming
Sort
View
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
15 years 3 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
15 years 1 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
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...
Olaf Chitil
GPEM
2011
14 years 4 months ago
Expert-driven genetic algorithms for simulating evaluation functions
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...
Omid David-Tabibi, Moshe Koppel, Nathan S. Netanya...
UC
2009
Springer
15 years 4 months ago
Reasoning about Entanglement and Separability in Quantum Higher-Order Functions
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...
Frédéric Prost, Chaouki Zerrari
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 1 months ago
A GP neutral function for the artificial ANT problem
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...
Esteban Ricalde, Katya Rodríguez-Váz...