Abstract Graph representations promise several desirable properties for genetic programming (GP); multiple-output programs, natural of code reuse and, in many cases, an innate mechanism neutral drift. Each graph GP technique provides a program representation, operators and overarching evolutionary algorithm. This makes it difficult to identify the individual causes empirical differences, both b...

Often GP evolves side effect free trees. These pure functional expressions can be evaluated in any order. In particular they interpreted from the genetic modification point outwards. Incremental evaluation exploits fact that: highly evolved children semantic difference between child and parent falls with distance syntactic disruption (e.g. crossover point) reach zero before whole has been inter...