An abstraction-based genetic programming system

  • Authors:

  • Franck Binard;Amy Felty

  • Affiliations:

  • University of Ottawa, Ottawa, ON, Canada;University of Ottawa, Ottawa, ON, Canada

  • Venue:
  • Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend tree-based typed Genetic Programming (GP) representation schemes by introducing System F, an expressive λ-calculus, for representing programs and types. At the level of programs, System F provides higher-order programming capabilities with functions and types as first-class objects, e.g., functions can take other functions and types as parameters. At the level of types, System F provides parametric polymorphism. The expressiveness of the system provides the potential for a genetic programming system to evolve looping, recursion, lists, trees and many other typical programming structures and behavior. This is done without introducing additional external symbols in the set of predefined functions and terminals of the system. In fact, we actually remove programming structures such as if/then/else, which we replace by two abstraction operators. We also change the composition of parse trees so that they may directly include types.