Abstract
The list is one of the basic data models used in computer programs [Aho and Ullman, 1995, page 286]. This chapter shows it is possible using genetic programming (GP) to evolve a list data structure from basic primitives. There are many ways in which a list can be implemented ([Aho et al., 1987] suggest three fundamentally different ways, each of which has many variations) but GP is able to co-evolve all the list components so they form a single working implementation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Langdon, W.B. (1998). Evolving a List. In: Genetic Programming and Data Structures. The Springer International Series in Engineering and Computer Science, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5731-9_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5731-9_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7625-5
Online ISBN: 978-1-4615-5731-9
eBook Packages: Springer Book Archive