Inductive Synthesis of Functional Programs
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 kth 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.
KeywordsInductive program synthesis folding recursive program schemes
TopicsSymbolic computations and machine learning term rewriting
Unable to display preview. Download preview PDF.
- [LM91]M. L. Lowry and R. D. McCarthy, editors. Autmatic Software Design. MIT Press, Cambridge, MA, 1991.Google Scholar
- [Sch01]Ute Schmid. Inductive synthesis of functional programs-Learning domain-specific control rules and abstract schemes. http://www.inf.uos.de/schmid/pub-ps/habil.ps.gz, Mai 2001. unpublished habilitation thesis.
- [SE99]S. Schrödl and S. Edelkamp. Inferring flow of control in program synthesis by example. In Proc. Annual German Conference on Artificial Intelligence (KI’99), Bonn, LNAI, pages 171–182. Springer, 1999.Google Scholar
- [SW00]U. Schmid and F. Wysotzki. Applying inductive programm synthesis to macro learning. In Proc. 5th International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), pages 371–378. AAAI Press, 2000.Google Scholar