Abstract
After a fast survey of the field, we describe Summers methodology and its extensions, by the mean of an example. The theoretical foundations of the method are fully detailed, together with an essential remaining open problem. A particular application is pre sented: the derecursivation of program schemes.
This is a preview of subscription content, log in via an institution to check access.
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
Bibel, W.: “On strategies for the synthesis of algorithms” Proc. AISB Meeting, Hamburg (1978), pp. 22–27.
Bierman, A.W.: “On the inference of Turing machines from sample computations”, Artificial Intelligence 3, (1972) 181–198.
Bierman, A.W.: “The inference of regular LISP programs from examples”, I. E.E.E. Trans, on Systems, Man and Cybernetics, vol. SMC-8, (1978), pp. 585–600.
Bierman, A.W., Smith, D.R.: “The hierarchical synthesis of LISP scanning programs”, Information Processing 77,B. Gilchrist ed., North Holland (1977), pp. 41–45.
Blum, L., Blum, M.: “Inductive inference: a recursion theoretic approach”, Recursion Function Theory Newsletter, n° 6, (1973), pp. 15–29.
Doner: “Tree acceptors and some of their applications”, J.C.S.S. 4 (1970).
Guiho, G., Gresse, C.: “Program synthesis from incomplete specifications”, Proc. 5th Conf. on Automated Deduction, Les Arcs (1980), pp. 53–62.
Hardy, J.: “Synthesis of LISP functions from examples”, Proc. 4th I.J.C.A.I. (1975), pp. 268–273.
Hedrick, C.L.: “Learning production systemsfrom examples”, Proc. 4th I.J.C.A. I. (1975).
Huet, G.: “Unification dans les theories d’ordre l,2,…,ω)” These de Doctorat, Paris V II (1976).
Jouannaud, J.P., Guiho, G.: “Inference of functions with an interactive system”, Machine Intelligence 9, (1979), pp. 227–250.
Jouannaud, J.P., Guiho, G., Treuil, J.P. “SISP/1, an interactive system able to synthesize functions from examples”, Proc. 5th I.J.C.A.I. (1977), pp. 412–418.
Jouannaud, J.P., Kirchner, C., Kirchner H., Picard, M.: “Signed trees: an algebraic frame for solving equations on binary trees. Application to LISP program synthesis and derecursivation”, Pub. CRIN, Univ. Nancy, (1980).
Jouannaud, J.P., Kodratoff, Y.: “Characterization of a class of functions synthesized from examples by a Summers like method using a BMW matching technique”, Proc. 6th I.J.C.A. I. (1979), pp. 440–447, Proofs in Pub. CRIN, Univ. Nancy (1979).
Jouannaud, J.P., Kodratoff, Y.: “An automatic construction of LISP programs by transformations of functions synthesized from their input-output behavior”, Intern. J. of Policy Analysis and Information Systems 4, (1980), pp. 331–358.
Kirchner, C., Kirchner, H., Jouannaud, J.P.: “Algebraic manipulations as a unification and matching strategy for linear equations in signed binary trees”, Pub. CRIN, Univ. Nancy (1981) and Proc. I.J.C.A. I. 1981.
Kodratoff, Y.: “A class of functions synthesized from a finite number of examples and a LISP program scheme”, Interntl. J. of Comp. and Information Sciences 8, (1979), pp. 489–521.
Kodratoff, Y., Jouannaud, J.P.: “A methodology for two variables functions synthesis from examples”, Pub. CRIN, Univ. Nancy (1979).
Kodratoff, Y., Papon, E.: “A system for program synthesis and program optimization”, Proc. A.I.S.B. meeting, Amsterdam (1980), pp. 1–10.
Manna, Z., Waldinger, R.: “A deductive approach to program synthesis”, A.C.M. ToP LaS 2, (1980), pp. 90–121.
Manna, Z., Ness, S., Vuillemin, J.: “Inductive methods for proving properties of programs”, Coiran. A.C.M. 16, (1973), pp. 491–502.
Papon, E.: “Algorithmes de dètection de relations de rècurrence - Application a la synthèse et à la transformation de programmes”, Thèse de 3éme cycle, Univ. Orsay (1981).
Shapiro, E.Y.: “Inductive inference of theories from facts” Yale University, Dept. Comp. Sci., Rep. 192 (Feb. 1981).
Shaw, D., Swartout W., Green C.: “Inferring LISP programs from examples”, Proc. 4th I.J.C.A.I., Tbilisi, pp. 268–273.
Summers, P.D.: “Programs construction from examples”, Ph. D. Thesis, Yale, (1975).
Summers, P.D.: “A methodology for LISP program construction from examples”, J. A.C.M. 24, (1978), pp. 161–175.
Waldinger, R., Lee, R.C.T.: “PROW: A step toward automatic program writing”, Proc. I.J.C.A.I., (1969), pp. 241–252.
Moore, J S.: “Introducing iteration into the pure LISP theorem prover”, I.E.E.E., SE-1, (1975), pp. 328–338.
Angluin, D.: “Summers revisited”, Internal Report, Yale University, (1981).
Gold, E.M.: “Language identification in the limit”, Information and Control 28, (1975).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 D. Reidel Publishing Company
About this paper
Cite this paper
Jouannaud, JP., Kodratoff, Y. (1983). Program Synthesis from Examples of Behavior. In: Biermann, A.W., Guiho, G. (eds) Computer Program Synthesis Methodologies. NATO Advanced Study Institutes Series, vol 95. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7019-9_7
Download citation
DOI: https://doi.org/10.1007/978-94-009-7019-9_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7021-2
Online ISBN: 978-94-009-7019-9
eBook Packages: Springer Book Archive