Inductive functional programming using incremental
program transformation
R. Olsson. Artificial Intelligence, 74 (1):
55--81(March 1995)
Abstract
The paper presents a system, ADATE, for automatic
functional programming. ADATE uses specifications that
contain few constraints on the programs to be
synthesised and that allow a wide range of correct
programs. ADATE can generate novel and unexpected
recursive programs with automatic invention of
recursive auxiliary functions. Successively better
programs are developed using incremental program
transformations. A key to the success of ADATE is the
exact design of these transformations and how to
systematically search for appropriate transformation
sequences.
heuristically guided enumeration. call count limit
(recursive calls). Example 2.2 simplification of
polynomials. Syntactic complexity = sum log_2
m.
Several references to automatic program invention (most
using LISP) from 1976 to 1992.
%0 Journal Article
%1 olsson:1995:AI
%A Olsson, Roland
%D 1995
%J Artificial Intelligence
%K ADATE, STGP algorithms, genetic programming,
%N 1
%P 55--81
%T Inductive functional programming using incremental
program transformation
%U http://www.ia-stud.hiof.no/~rolando/art_int_paper_74.ps
%V 74
%X The paper presents a system, ADATE, for automatic
functional programming. ADATE uses specifications that
contain few constraints on the programs to be
synthesised and that allow a wide range of correct
programs. ADATE can generate novel and unexpected
recursive programs with automatic invention of
recursive auxiliary functions. Successively better
programs are developed using incremental program
transformations. A key to the success of ADATE is the
exact design of these transformations and how to
systematically search for appropriate transformation
sequences.
@article{olsson:1995:AI,
abstract = {The paper presents a system, ADATE, for automatic
functional programming. ADATE uses specifications that
contain few constraints on the programs to be
synthesised and that allow a wide range of correct
programs. ADATE can generate novel and unexpected
recursive programs with automatic invention of
recursive auxiliary functions. Successively better
programs are developed using incremental program
transformations. A key to the success of ADATE is the
exact design of these transformations and how to
systematically search for appropriate transformation
sequences.},
added-at = {2008-06-19T17:46:40.000+0200},
author = {Olsson, Roland},
biburl = {https://www.bibsonomy.org/bibtex/2fad20de8a799cff39319cd427fb1ca58/brazovayeye},
interhash = {db19abb2094f0beb9bfb35ab9cfc69be},
intrahash = {fad20de8a799cff39319cd427fb1ca58},
journal = {Artificial Intelligence},
keywords = {ADATE, STGP algorithms, genetic programming,},
month = {March},
notes = {heuristically guided enumeration. call count limit
(recursive calls). Example 2.2 simplification of
polynomials. Syntactic complexity = sum log_2
m.
Several references to automatic program invention (most
using LISP) from 1976 to 1992.},
number = 1,
pages = {55--81},
size = {27 pages},
timestamp = {2008-06-19T17:48:47.000+0200},
title = {Inductive functional programming using incremental
program transformation},
url = {http://www.ia-stud.hiof.no/~rolando/art_int_paper_74.ps},
volume = 74,
year = 1995
}