Abstraction-Based Genetic Programming: An Application of the polymorphically-typed lambda calculus to genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Book{Binard:book,

• author = "Franck Binard",
• title = "Abstraction-Based Genetic Programming: An Application of the polymorphically-typed lambda calculus to genetic programming",
• publisher = "Verlag Dr. Mueller",
• year = "2009",
• month = "6 " # oct,
• keywords = "genetic algorithms, genetic programming",
• ISBN = "3-639-19173-0",
• URL = "https://www.amazon.co.uk/Abstraction-Based-Genetic-Programming-Application-polymorphically-typed/dp/3639191730",
• size = "184 pages",
• abstract = "Abstraction-Based Genetic Programming (ABGP) is a novel Genetic Programming (GP) system in which the set of all possible genotypes is partitioned by the proofs to which each program is linked via the Curry-Howard isomorphism. In the context of ABGP, proofs are related to computer programs in the same way as species are related to organisms in the biological world. They can be seen as patterns into which alleles of genes may be plugged in. In this analogy, genes are types and an allele of a gene is a closed typed computational block that may be combined with other blocks to form an organism. The type of an allele is the gene to which it corresponds.",

}

Genetic Programming entries for Franck J L Binard

Citations