@inproceedings{KitzelmannSMW02IS,
title = {Folding of finite program terms to recursive program schemes},
author = {Emanuel Kitzelmann and Ute Schmid and Martin M{\"u}hlpfordt and Fritz Wysotzki},
booktitle = {Intelligent Systems, 2002. Proceedings. 2002 First International IEEE Symposium},
pages = {144--149 vol.1},
url = {http://dx.doi.org/10.1109/IS.2002.1044245},
volume = {1},
year = {2002},
description = {Welcome to IEEE Xplore 2.0: Folding of finite program terms to recursive program schemes},
abstract = {We present an approach to inductive synthesis of functional programs based on the detection of recurrence relations. A given term is considered as the k-th unfolding of an unknown recursive program. If a recurrence relations can be identified in the term, it can be folded into a recursive program which: (a) can reproduce the term and (b) generalizes over it. Our approach goes beyond Summers' classical approach (1977) 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.},
pdf = {http://www.cogsys.wiai.uni-bamberg.de/publications/ieeeis02.pdf},
keywords = {analytical_ip ifp igor1 induction inductive_programming inproceedings program_synthesis recursive_program_schemes }
}
::