- title = "Functional Genetic Programming with Combinators",
- author = "Forrest Briggs and Melissa O'Neill",
- booktitle = "Proceedings of the Third Asian-Pacific workshop on Genetic Programming",
- year = "2006",
- editor = "The Long Pham and Hai Khoi Le and Xuan Hoai Nguyen",
- pages = "110--127",
- ISSN = "18590209",
- address = "Military Technical Academy, Hanoi, VietNam",
- keywords = "genetic algorithms, genetic programming",
-
URL = "
http://sc.snu.ac.kr/courses/2006/fall/pg/aai/GP/forrest/fsb-meo-combs.pdf",
-
URL = "http://gpbib.cs.ucl.ac.uk/aspgp06/fsb-meo-combs.pdf",
- size = "18 pages",
- abstract = "Prior program representations for genetic programming that incorporated features of modern programming languages solved harder problems than earlier representations, but required more complex genetic operators. We develop the idea of using combinator expressions as a program representation for genetic programming. This representation makes it possible to evolve programs with a variety of programming language constructs using simple genetic operators. We investigate the effort required to evolve combinator-expression solutions to several problems: linear regression, even parity on N inputs, and implementation of the stack and queue data structures. Genetic programming with combinator expressions compares favourably to prior approaches, namely the works of Yu [37], Kirshenbaum [18], Agapitos and Lucas [1], Wong and Leung [35], Koza [20], Langdon \cite{Langdon:1995:GPdata}, and Katayama [17].",
-
notes = "Harvey Mudd College, Claremont, CA, U.S.A.
broken march 2020 http://www.aspgp.org",
