@inproceedings (Langdon:1996:usedata,
  author = 	{W. B. Langdon},
  title =	{Using Data Structures within Genetic Programming},
  booktitle =	{Genetic Programming 1996 : 
	Proceedings of the First Conference},
  editor = 	{John R. Koza and David E. Goldberg and 
	David B. Fogel and Rick L. Riolo},
  year = 	1996,
  month =	{28--31 July},
  keywords =    {Genetic Programming, Genetic Algorithms, 
context free language induction, Reverse Polish Expressions,
automatic code generation,
Automatic Programming, Machine Learning, Artificial Evolution,
Data Structures, Object Oriented Programming, 
Push down Stack, 
Automatically Defined Functions (ADF), Pareto fitness, Demes
},
  pages = 	{},
  address = 	{Stanford University, CA, USA},
  publisher_address = 	{},
  organisation ={},
  publisher = 	{MIT Press},
  note =	{to appear in},
%ignored by BibTex but available for automatic searching
% email =	{},
  ISBN =        {},
  url =         {ftp://cs.ucl.ac.uk/genetic/papers/WBL.gp96.ps},
  size = 	{9 pages},
  abstract =	{
Provision of appropriately structured memory is shown, in some cases,
to be advantageous to genetic programming (GP) in comparison with
directly addressable indexed memory.


Three ``classic'' problems are solved. The first two require the GP to
distinguish between sentences that are in a context free language 
and those that
are not given positive and negative training examples of the language. The two
languages are, correctly nested brackets and a Dyck language
(correctly nested brackets of different types).  The third problem is
to evaluate integer Reverse Polish (postfix) expressions.

Comparisons are made between GP attempting to solve these problems
when provided with indexed memory or with stack data structures.
},
  notes =	{GP-96. Replaces Langdon:1996:usedataRN}
)

@techreport(Langdon:1996:usedataRN,
  author = 	{W. B. Langdon},
  title =	{Using Data Structures within Genetic Programming},
  institution =	{UCL},
  year = 	1996,
  type =	{Research Note},
  number =	{RN/96/1},
  address =	{Gower Street, London, WC1E 6BT, UK},
  month =	{January},
  keywords =    {Genetic Programming, Genetic Algorithms, 
context free language induction, Reverse Polish Expressions,
automatic code generation,
Automatic Programming, Machine Learning, Artificial Evolution,
Data Structures, Object Oriented Programming, 
Push down Stack, 
Automatically Defined Functions (ADF), Pareto fitness, Demes
},
  url =         {ftp://cs.ucl.ac.uk/genetic/papers/WBL.gp96.ps},
  abstract =	{
In earlier work we showed that GP can automatically
generate simple data types (stacks, queues and lists). The results
presented herein show, in some cases, provision of appropriately
structured memory can indeed be advantageous to GP in comparison with
directly addressable indexed memory.


Three ``classic'' problems are solved. The first two require the GP to
distinguish between sentences that are in a language and those that
are not given positive and negative training examples of the language. The two
languages are, correctly nested brackets and a Dyck language
(correctly nested brackets of different types).  The third problem is
to evaluate integer Reverse Polish (postfix) expressions.

Comparisons are made between GP attempting to solve these problems
when provided with indexed memory or with stack data structures.
},
  notes =	{Accepted for presentation at GP96. Updated version in
proceedings and url, see Langdon:1996:usedata},
  size = 	{10 pages}
)