Sciweavers

Share
GECCO
2008
Springer

Genetic programming with polymorphic types and higher-order functions

8 years 8 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-based representation scheme. This allows us to represent many typical computational structures by abstractions rather than by functions defined in the GP system’s terminal set. The result is a generic GP system that is able to express programming structures such as recursion and data types without explicit definitions. We demonstrate the expressive power of this approach by evolving simple boolean programs without defining a set of terminals. We also evolve programs that exhibit recursive behavior without explicitly defining recursion specific syntax in the terminal set. In this article, we present our approach and experimental results. Categories and Subject Descriptors I.2.2 [Artificial Intelligence]: Automatic Programming— program synthesis; F.4.1 [Mathematical Logic and Formal Languages]: Mathemat...
Franck Binard, Amy P. Felty
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2008
Where GECCO
Authors Franck Binard, Amy P. Felty
Comments (0)
books