Utilization of Reductions and Abstraction Elimination in Typed Genetic Programming

0430974 - ÚI 2015 RIV US eng C - Konferenční příspěvek (zahraniční konf.)
Křen, T. - Neruda, Roman
Utilization of Reductions and Abstraction Elimination in Typed Genetic Programming.
GECCO '14. Proceedings of the 2014 Conference on Genetic and Evolutionary Computation. New York: ACM, 2014 - (Igel, C.; Arnold, D.), s. 943-950. ISBN 978-1-4503-2662-9.
[GECCO 2014. Genetic and Evolutionary Computation Conference. Vancouver (CA), 12.07.2014-16.07.2014]
Grant CEP: GA ČR GAP202/10/1333; GA MŠMT(CZ) LD13002
Grant ostatní: SVV(CZ) 260 104
Institucionální podpora: RVO:67985807
Klíčová slova: genetic programming * lambda calculus
Kód oboru RIV: IN - Informatika

Lambda calculus representation of programs offers a more expressive alternative to traditional S-expressions. In this paper we discuss advantages of this representation coming from the use of reductions (beta and eta) and a way to over-come disadvantages caused by variables occurring in the programs by use of the abstraction elimination algorithm. We discuss the role of those reductions in the process of generating initial population and propose two novel crossover operations based on abstraction elimination capable of handling general form of typed lambda term while being a straight generalization of the standard crossover operation. We compare their performances using the even parity benchmark problem.
Trvalý link: http://hdl.handle.net/11104/0235640