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 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. L. Lowry and R. D. McCarthy, editors. Autmatic Software Design. MIT Press, Cambridge, MA, 1991.
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.
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.
P. D. Summers. A methodology for LISP program construction from examples. Journal ACM, 24(1): 162–175, 1977.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitzelmann, E., Schmid, U., Mühlpfordt, M., Wysotzki, F. (2002). Inductive Synthesis of Functional Programs. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds) Artificial Intelligence, Automated Reasoning, and Symbolic Computation. AISC Calculemus 2002 2002. Lecture Notes in Computer Science(), vol 2385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45470-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-45470-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43865-6
Online ISBN: 978-3-540-45470-0
eBook Packages: Springer Book Archive