l'ÉITI Recherche Nouvelles HREF= Répertoires Ressources Génie/Engineering Ud'O/UofO SITE Search News Directories Resources SITE

Absfract: an Abstraction-Based Genetic Programming System

Project page

Overview

Currently the only introduction to the theoretical particularities of the Absfract system is probably this article, submitted to GECCO 2007.

Absfract implements a new method for composing parse trees for the purpose of automatic programming. The method uses polymorphical type theory and second order logic to represent higher level algorithms.

Description of the Absfract project

Absfract is a GP system that uses System F (see chapter 11 of this book) to encode the parse trees of its individuals. The programs that are evolved by the system are:

In addition, Absfract uses a unique crossover scheme that allows it to select and recombine not only full-programs, but program patterns as well.

An implementation of the Absfract system is currently being built in OCaml.

Examples:
Franck J.L. Binard

School of Information Technology and Engineering (SITE)
University of Ottawa
800 King Edward Ave.
Ottawa, Ontario, Canada, K1N 6N5
Tel: (613) 562-5800 x6727, Fax: (613) 562-5664
Office: 4-035 SITE
Email: fbinard@site.uottawa.ca
Contactez: L'École d'ingénierie et de technologie de l'information
Contact: School of Information Technology and Engineering
Copyright © 2001 Université d'Ottawa / University of Ottawa
Webmestre / Webmaster