Abstract
In part II we discussed inductive program synthesis as an approach to learning recursive program schemes. Alternatively, in this chapter, we investigate how a recursive program scheme can be generalized from two, structurally similar programs and how a new recursive program can be constructed by adapting an already known scheme. Generalization can be seen as the last step of programming or problem solving by analogy.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmid, U. (2003). 12. Programming by Analogy. 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_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-44846-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40174-2
Online ISBN: 978-3-540-44846-4
eBook Packages: Springer Book Archive