@inproceedings{Kitzelmann02a,
title = {Inductive Synthesis of Functional Programs},
author = {Emanuel Kitzelmann and Ute Schmid and Martin M{\"u}hlpfordt and Fritz Wysotzki},
booktitle = {AISC '02/Calculemus '02: Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation},
pages = {337--354},
publisher = {Springer-Verlag},
series = {LNCS},
url = {http://www.springerlink.com/content/r02frg6bh82g29pw/},
volume = {2385},
year = {2002},
description = {Inductive Synthesis of Functional Programs},
abstract = {We present an approach to folding of finite program terms based on the detection of recurrence relations in a single given term which is considered as the k-th unfolding of an unknown recursive program. Our approach goes beyond Summers' classical approach in several aspects: It is language independent and works for terms belonging to an arbitrary term algebra; it allows induction of sets of recursive equations which are in some arbitrary ``calls'' relation; induced equations can be dependent on more than one input parameters and we can detect interdependencies of variable substitutions in recursive calls; the given input terms can represent incomplete unfoldings of an hypothetical recursive program.},
isbn = {3-540-43865-3},
keywords = {2002 automatic_programming functional_programming igor1 induction inductive inductive_functional_programming inductive_inference inductive_program_synthesis inductive_programming inproceedings myown programming published recursive_program_schemes }
}
::