Advertisement

Inductive Synthesis of Functional Programs

  • Emanuel Kitzelmann
  • Ute Schmid
  • Martin Mühlpfordt
  • Fritz Wysotzki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2385)

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.

Keywords

Inductive program synthesis folding recursive program schemes 

Topics

Symbolic computations and machine learning term rewriting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [LM91]
    M. L. Lowry and R. D. McCarthy, editors. Autmatic Software Design. MIT Press, Cambridge, MA, 1991.Google Scholar
  2. [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.
  3. [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
  4. [Sum77]
    P. D. Summers. A methodology for LISP program construction from examples. Journal ACM, 24(1): 162–175, 1977.CrossRefMathSciNetGoogle Scholar
  5. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Emanuel Kitzelmann
    • 1
  • Ute Schmid
    • 2
  • Martin Mühlpfordt
    • 3
  • Fritz Wysotzki
    • 1
  1. 1.Department of Computer ScienceTechnical University BerlinGermany
  2. 2.Institute of Computer ScienceUniversity of OsnabrückGermany
  3. 3.German National Research Center for Information Technology (GMD)DarmstadtGermany

Personalised recommendations