E. Kitzelmann, U. Schmid, M. Mühlpfordt, and F. Wysotzki. Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation, volume 2385 of LNCS, page 337--354. Springer-Verlag, (2002)
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.
%0 Conference Paper
%1 KiScMuWy02
%A Kitzelmann, Emanuel
%A Schmid, Ute
%A Mühlpfordt, Martin
%A Wysotzki, Fritz
%B Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
%D 2002
%I Springer-Verlag
%K analytical_ip ifp igor1 induction inductive_programming inproceedings program_synthesis recursive_program_schemes
%P 337--354
%T Inductive Synthesis of Functional Programs
%U http://www.springerlink.com/content/r02frg6bh82g29pw/
%V 2385
%X 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.
@inproceedings{KiScMuWy02,
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.},
added-at = {2009-06-20T18:43:15.000+0200},
author = {Kitzelmann, Emanuel and Schmid, Ute and M{\"u}hlpfordt, Martin and Wysotzki, Fritz},
biburl = {https://www.bibsonomy.org/bibtex/2494c29710e0fc0f8884611209bd13564/emanuel},
booktitle = {Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation},
description = {Inductive Synthesis of Functional Programs},
interhash = {bc1717a96ed4ab9c945231b4c3634f0b},
intrahash = {494c29710e0fc0f8884611209bd13564},
keywords = {analytical_ip ifp igor1 induction inductive_programming inproceedings program_synthesis recursive_program_schemes},
pages = {337--354},
pdf = {http://www.cogsys.wiai.uni-bamberg.de/publications/aisc02.pdf},
publisher = {Springer-Verlag},
series = {LNCS},
timestamp = {2009-06-20T18:43:16.000+0200},
title = {Inductive Synthesis of Functional Programs},
url = {http://www.springerlink.com/content/r02frg6bh82g29pw/},
volume = 2385,
year = 2002
}