BibSonomy publications for /user/emanuel/recursive_program_schemesThu Oct 02 22:33:10 CEST 2008Cambridge, MA, USAHandbook of Theoretical Computer Science: Formal Models and Semantics9459--492Recursive Applicative Program SchemesB1990semantics recursive_program_schemes Thu Oct 02 16:31:30 CEST 2008Theory of Computing Systems1131--180Infinite Trees in Normal Form and Recursive Equations having a Unique Solution131979semantics recursive_program_schemes A system of recursive equations isC-univocal if it has a unique solution modulo the equivalence associated with a classC of interpretations. This concept yields simplified proofs of equivalence of recursive program schemes and correctness criteria for the validity of certain program transformations, provided one has syntactic easily testable conditions forC-univocality.Sat Jun 14 17:51:34 CEST 2008AISC '02/Calculemus '02: Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation337--354LNCSInductive Synthesis of Functional Programs23852002program_synthesis inductive_programming analytical_ip induction ifp recursive_program_schemes inproceedings igor1 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.Sat Jun 14 17:48:46 CEST 2008Inductive Functional Program Synthesis -- a Term-Construction and Folding Approach2003program_synthesis inductive_programming analytical_ip induction mastersthesis ifp recursive_program_schemes igor1 Sat Jun 14 17:46:10 CEST 2008Intelligent Systems, 2002. Proceedings. 2002 First International IEEE Symposium144--149 vol.1Folding of finite program terms to recursive program schemes12002program_synthesis inductive_programming analytical_ip induction ifp recursive_program_schemes inproceedings igor1 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.Sat Jun 14 17:41:39 CEST 2008Cambridge, MA, USAJournal of Machine Learning Research429--454Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach72006program_synthesis inductive_programming article analytical_ip induction ifp recursive_program_schemes igor1 ebg We describe an approach to the inductive synthesis of recursive equations from input/output-examples which is based on the classical two-step approach to induction of functional Lisp programs of Summers (1977). In a first step, I/O-examples are rewritten to traces which explain the outputs given the respective inputs based on a datatype theory. These traces can be integrated into one conditional expression which represents a non-recursive program. In a second step, this initial program term is generalized into recursive equations by searching for syntactical regularities in the term. Our approach extends the classical work in several aspects. The most important extensions are that we are able to induce a set of recursive equations in one synthesizing step, the equations may contain more than one recursive call, and additionally needed parameters are automatically introduced.Sat Jun 14 17:38:17 CEST 2008Proceedings of the ICML 2005 Workshop on Approaches and Applications of Inductive Programming15--27An Explanation Based Generalization Approach to Inductive Synthesis of Functional Programs2005program_synthesis inductive_programming machine_learning analytical_ip induction ifp recursive_program_schemes inproceedings igor1 ebg Sat Jun 14 17:36:10 CEST 2008Beitr{\"a}ge zum Treffen der GI-Fachgruppe 1.1.3 Maschinelles Lernen (FGML 2002)135--141Inductive Program Synthesis: From Theory to Application2002program_synthesis inductive_programming machine_learning induction ifp recursive_program_schemes inproceedings