Genetic programming with polymorphic types and higher-order functions

@inproceedings{Binard2008GeneticPW,
  title={Genetic programming with polymorphic types and higher-order functions},
  author={F. Binard and A. Felty},
  booktitle={GECCO '08},
  year={2008}
}
  • F. Binard, A. Felty
  • Published in GECCO '08 2008
  • Computer Science
  • This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed abstraction-based representation scheme. This allows us to represent many typical computational structures by abstractions rather than by functions defined in the GP system's terminal set. The result is a generic GP system that is able to express programming structures such as recursion and data types without explicit… CONTINUE READING
    Inductive Programming: A Survey of Program Synthesis Techniques
    • 84
    • PDF
    MT-CGP: mixed type cartesian genetic programming
    • 30
    • PDF
    General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases
    • 18
    • Highly Influenced
    • PDF
    A survey of modularity in genetic programming
    • 6
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems
    • 656
    • Highly Influential
    • PDF
    Genetic Programming II
    • 938
    • Highly Influential