An abstraction-based genetic programming system
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @InProceedings{1274004,
-
author = "Franck Binard and Amy Felty",
-
title = "An abstraction-based genetic programming system",
-
booktitle = "Late breaking paper at Genetic and Evolutionary
Computation Conference {(GECCO'2007)}",
-
year = "2007",
-
month = "7-11 " # jul,
-
editor = "Peter A. N. Bosman",
-
pages = "2415--2422",
-
address = "London, United Kingdom",
-
publisher = "ACM Press",
-
publisher_address = "New York, NY, USA",
-
keywords = "genetic algorithms, genetic programming, lambda
calculus, languages, polymorphism, types",
-
isbn13 = "978-1-59593-698-1",
-
URL = "http://gpbib.cs.ucl.ac.uk/gecco2007/docs/p2415.pdf",
-
DOI = "doi:10.1145/1274000.1274004",
-
abstract = "We extend tree-based typed Genetic Programming (GP)
representation schemes by introducing System F, an
expressive l-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 behaviour. 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.",
-
notes = "Distributed on CD-ROM at GECCO-2007 ACM Order No.
910071",
- }
Genetic Programming entries for
Franck J L Binard
Amy Felty
Citations