%0 Journal Article %1 TinaYu:2001:GPEM %A Yu, Tina %D 2001 %J Genetic Programming and Evolvable Machines %K abstraction, algorithms, functions, genetic hierarchical higher-order lambda polymorphism, processing, programming, recursion, structure systems type %N 4 %P 345--380 %R doi:10.1023/A:1012926821302 %T Hierachical Processing for Evolving Recursive and Modular Programs Using Higher Order Functions and Lambda Abstractions %V 2 %X We present a novel approach using higher-order functions and l abstraction to evolve recursive and modular programs. Moreover, a new term 'structure abstraction' is introduced to describe the property emerged from the higher-order function program structure. We test this technique on the general even-parity problem. The results indicate that this approach is very effective with the general even-parity problem due to the appropriate selection of the foldr higher-order function. Initially, foldr structure abstraction identify the promising area of the search space at generation zero. Once the population is within the promising area, foldr structure abstraction provides hierarchical processing for search. Consequently, solutions to the general even-parity problem are found very efficiently. We identify the limitations of this new approach and conclude that only when the appropriate higher-order function is selected that the benefits of structure abstraction show.

@article{TinaYu:2001:GPEM, abstract = {We present a novel approach using higher-order functions and l abstraction to evolve recursive and modular programs. Moreover, a new term 'structure abstraction' is introduced to describe the property emerged from the higher-order function program structure. We test this technique on the general even-parity problem. The results indicate that this approach is very effective with the general even-parity problem due to the appropriate selection of the foldr higher-order function. Initially, foldr structure abstraction identify the promising area of the search space at generation zero. Once the population is within the promising area, foldr structure abstraction provides hierarchical processing for search. Consequently, solutions to the general even-parity problem are found very efficiently. We identify the limitations of this new approach and conclude that only when the appropriate higher-order function is selected that the benefits of structure abstraction show.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Yu, Tina}, biburl = {https://www.bibsonomy.org/bibtex/236bba03c8a5544d3062e864067d8644e/brazovayeye}, doi = {doi:10.1023/A:1012926821302}, interhash = {737ed1b4777e35a0f35c9f67c342b6c7}, intrahash = {36bba03c8a5544d3062e864067d8644e}, issn = {1389-2576}, journal = {Genetic Programming and Evolvable Machines}, keywords = {abstraction, algorithms, functions, genetic hierarchical higher-order lambda polymorphism, processing, programming, recursion, structure systems type}, month = {December}, notes = {STGP polymorphic general solution to even-n-parity from 12 test cases. Article ID: 386362}, number = 4, pages = {345--380}, timestamp = {2008-06-19T17:54:59.000+0200}, title = {Hierachical Processing for Evolving Recursive and Modular Programs Using Higher Order Functions and Lambda Abstractions}, volume = 2, year = 2001 }