[Haskell-beginners] Fast tree manipulation

Gabi bugspynet at gmail.com
Wed Feb 3 07:47:01 EST 2010

I plan to implement some form of GP (GeneticProgramming) system.
The trees would represent execution trees which means each node in the
tree will represent a function, and leaves would represent terminals.
An efficient GP system would fail if the tree manipulation operators
(crossover, mutation) are slow.



More information about the Beginners mailing list