%0 Conference Paper %1 yu:2001:EuroGP_poly %A Yu, Tina %B Genetic Programming, Proceedings of EuroGP'2001 %C Lake Como, Italy %D 2001 %E Miller, Julian F. %E Tomassini, Marco %E Lanzi, Pier Luca %E Ryan, Conor %E Tettamanzi, Andrea G. B. %E Langdon, William B. %I Springer-Verlag %K Constraint GP, Multi-objective PolyGP Polymorphism, STGP, Strongly Typed algorithms, genetic handling, optimisation, programming, %P 218--233 %T Polymorphism and Genetic Programming %U http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2038&spage=218 %V 2038 %X Types have been introduced to Genetic Programming (GP) by researchers with different motivation. We present the concept of types in GP and introduce a typed GP system, PolyGP, that supports polymorphism through the use of three different kinds of type variable. We demonstrate the usefulness of this kind of polymorphism in GP by evolving two polymorphic programs (nth and map) using the system. Based on the analysis of a series of experimental results, we conclude that this implementation of polymorphism is effective in assisting GP evolutionary search to generate these two programs. PolyGP may enhance the applicability of GP to a new class of problems that are difficult for other polymorphic GP systems to solve. %@ 3-540-41899-7

@inproceedings{yu:2001:EuroGP_poly, abstract = {Types have been introduced to Genetic Programming (GP) by researchers with different motivation. We present the concept of types in GP and introduce a typed GP system, PolyGP, that supports polymorphism through the use of three different kinds of type variable. We demonstrate the usefulness of this kind of polymorphism in GP by evolving two polymorphic programs (nth and map) using the system. Based on the analysis of a series of experimental results, we conclude that this implementation of polymorphism is effective in assisting GP evolutionary search to generate these two programs. PolyGP may enhance the applicability of GP to a new class of problems that are difficult for other polymorphic GP systems to solve.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Lake Como, Italy}, author = {Yu, Tina}, biburl = {https://www.bibsonomy.org/bibtex/2afc4480fd90169c33af621798cdb8cb0/brazovayeye}, booktitle = {Genetic Programming, Proceedings of EuroGP'2001}, editor = {Miller, Julian F. and Tomassini, Marco and Lanzi, Pier Luca and Ryan, Conor and Tettamanzi, Andrea G. B. and Langdon, William B.}, interhash = {62e5cbe7caddb7241a40e5f97700a03e}, intrahash = {afc4480fd90169c33af621798cdb8cb0}, isbn = {3-540-41899-7}, keywords = {Constraint GP, Multi-objective PolyGP Polymorphism, STGP, Strongly Typed algorithms, genetic handling, optimisation, programming,}, month = {18-20 April}, notes = {EuroGP'2001, part of miller:2001:gp. Best presentation}, organisation = {EvoNET}, pages = {218--233}, publisher = {Springer-Verlag}, publisher_address = {Berlin}, series = {LNCS}, size = {16 pages}, timestamp = {2008-06-19T17:55:01.000+0200}, title = {Polymorphism and Genetic Programming}, url = {http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2038&spage=218}, volume = 2038, year = 2001 }