Abstract
We introduced analogy and abstraction as alternative to inductive program synthesis by folding of initial trees. In general, analogy is not more efficient than folding for generalizing recursive program schemes from finite programs. Nevertheless, it is a method which we find interesting for two reasons: Fist, using anti-unification, mapping and generalization can be realized within the same framework and we can demonstrate (currently only with toy-examples) how abstract program schemes can be learned from some initial programming experience. Second, analogy is considered as a crucial strategy in human problem solving and learning.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmid, U. (2003). 13. Conclusions and Further Research. In: Inductive Synthesis of Functional Programs. Lecture Notes in Computer Science(), vol 2654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44846-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-44846-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40174-2
Online ISBN: 978-3-540-44846-4
eBook Packages: Springer Book Archive