@incollection(langdon:1996:aigp2,
  author =	{William B. Langdon},
  title =	{Data Structures and Genetic Programming},
  booktitle =	{Advances in Genetic Programming 2},
  publisher =	{MIT Press},
  year =	1996,
  editor =	{P. Angeline and K. E. {Kinnear, Jr.}},
  pages =	{},
  chapter =	{20},
  type =	{},
  address =	{Cambridge, MA, USA},
  edition =	{},
  month =	{},
  note =	{},
  keywords =    {genetic algorithms, genetic programming},
  ISBN =        {},
  url =         {ftp://cs.ucl.ac.uk/genetic/papers/WBL.aigp2.ch20.ps},
  abstract =	{In real world applications, software engineers recognise
the use of memory must be organised via data structures and that
software using the data must be independant of the data structures'
implementation details.  They achieve this by using abstract data
structures, such as records, files and buffers.

We demonstrate that genetic programming can
automatically implement simple abstract data structures, considering in
detail the task of evolving a list.
We show general and reasonably efficient implementations can be automatically
generated from simple primitives.

A model for maintaining evolved code is 
demonstrated using the list problem.
},
  notes =	{},
  size =	{20 pages}
)