BibSonomy publications for /user/mh/2002Wed Oct 17 15:28:39 CEST 2007Beitr{\"a}ge zum Treffen der GI-Fachgruppe 1.1.3 Maschinelles Lernen (FGML 2002)135--141Inductive Program Synthesis: From Theory to Application2002induction inductive_inference automatic_programming programming 2002 inductive_learning inductive_program_synthesis inductive_functional_programming recursive_program_schemes inductive_programming inproceedings inductive machine_learning Wed Oct 17 15:28:39 CEST 2007AISC '02/Calculemus '02: Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation337--354LNCSInductive Synthesis of Functional Programs23852002inductive_functional_programming inproceedings myown 2002 programming induction inductive igor1 automatic_programming recursive_program_schemes published functional_programming inductive_inference inductive_program_synthesis inductive_programming 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.Wed Oct 17 15:28:39 CEST 2007Intelligent Systems, 2002. Proceedings. 2002 First International IEEE Symposium144--149 vol.1Folding of finite program terms to recursive program schemes12002automatic_programming igor1 inductive_inference myown published inductive_functional_programming functional_programming programming inductive_programming inductive_program_synthesis 2002 induction recursive_program_schemes inductive inproceedings 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.