%0 Conference Paper %1 1068292 %A Spector, Lee %A Klein, Jon %A Keijzer, Maarten %B GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation %C Washington DC, USA %D 2005 %E Beyer, Hans-Georg %E O'Reilly, Una-May %E Arnold, Dirk V. %E Banzhaf, Wolfgang %E Blum, Christian %E Bonabeau, Eric W. %E Cantu-Paz, Erick %E Dasgupta, Dipankar %E Deb, Kalyanmoy %E Foster, James A. %E de Jong, Edwin D. %E Lipson, Hod %E Llora, Xavier %E Mancoridis, Spiros %E Pelikan, Martin %E Raidl, Guenther R. %E Soule, Terence %E Tyrrell, Andy M. %E Watson, Jean-Paul %E Zitzler, Eckart %I ACM Press %K Fibonacci a algorithms, combinators, experimentation, exponentiation, factorial, genetic iteration, languages, list, parity, programming programming, push, recursion, reversing sequence, sorting, stack-based %P 1689--1696 %T The Push3 execution stack and the evolution of control %U http://doi.acm.org/10.1145/1068009.1068292 %V 2 %X One of Push's attractive features in this context is its transparent support for the expression and evolution of modular architectures and complex control structures, achieved through explicit code self-manipulation. The latest version of Push, Push3, enhances this feature by permitting explicit manipulation of an execution stack that contains the expressions that are queued for execution in the interpreter. presents a series of examples in which Push3 was used with a simple genetic programming system (PushGP) to evolve programs with non-trivial control structures. %@ 1-59593-010-8

@inproceedings{1068292, abstract = {One of Push's attractive features in this context is its transparent support for the expression and evolution of modular architectures and complex control structures, achieved through explicit code self-manipulation. The latest version of Push, Push3, enhances this feature by permitting explicit manipulation of an execution stack that contains the expressions that are queued for execution in the interpreter. presents a series of examples in which Push3 was used with a simple genetic programming system (PushGP) to evolve programs with non-trivial control structures.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {Washington DC, USA}, author = {Spector, Lee and Klein, Jon and Keijzer, Maarten}, biburl = {https://www.bibsonomy.org/bibtex/2256df0aa2100be3f639f46680e2473f6/brazovayeye}, booktitle = {{GECCO 2005}: Proceedings of the 2005 conference on Genetic and evolutionary computation}, editor = {Beyer, Hans-Georg and O'Reilly, Una-May and Arnold, Dirk V. and Banzhaf, Wolfgang and Blum, Christian and Bonabeau, Eric W. and Cantu-Paz, Erick and Dasgupta, Dipankar and Deb, Kalyanmoy and Foster, James A. and {de Jong}, Edwin D. and Lipson, Hod and Llora, Xavier and Mancoridis, Spiros and Pelikan, Martin and Raidl, Guenther R. and Soule, Terence and Tyrrell, Andy M. and Watson, Jean-Paul and Zitzler, Eckart}, interhash = {4bc094f021d187d6ae3f77d3d40b2de8}, intrahash = {256df0aa2100be3f639f46680e2473f6}, isbn = {1-59593-010-8}, keywords = {Fibonacci a algorithms, combinators, experimentation, exponentiation, factorial, genetic iteration, languages, list, parity, programming programming, push, recursion, reversing sequence, sorting, stack-based}, month = {25-29 June}, notes = {GECCO-2005 A joint meeting of the fourteenth international conference on genetic algorithms (ICGA-2005) and the tenth annual genetic programming conference (GP-2005). ACM Order Number 910052 Cited by \cite{eurogp06:AgapitosLucas} EXEC stack. Combinators. Reentrant p1691 'the re-entrant interpreter allows for the controlled execution of a particular number of instructions per time-step.' Reversing a list. Factorial. Fibonacci. Parity. Powers of two, integer exponentiation Expt(2,n). Sorting a list.}, organisation = {ACM SIGEVO (formerly ISGEC)}, pages = {1689--1696}, publisher = {ACM Press}, publisher_address = {New York, NY, 10286-1405, USA}, timestamp = {2008-06-19T17:52:11.000+0200}, title = {The Push3 execution stack and the evolution of control}, url = {http://doi.acm.org/10.1145/1068009.1068292}, volume = 2, year = 2005 }