Skip to main content

On inductive synthesis of programs

  • Conference paper
  • First Online:
Algorithms in Modern Mathematics and Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 122))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.M. Barzdin. Inductive inference of automata, functions and programs. Proceedings of the International Congress of Mathematicians, Canada, 1974, vol.2, p. 455–460.

    Google Scholar 

  2. A.W. Biermann. Approaches to automatic programming. — In: Advances in Computers, vol.15, N.Y. Academic, 1976, p. 1–63.

    Google Scholar 

  3. A.W. Biermann. Constructing programs from example computations. IEEE Trans. of Software Engineering, vol. SE-2, no.3 (1976), p. 141–153.

    Google Scholar 

  4. M.A. Bauer. Programming by examples. Artificial Intelligence, vol.12 (1979), p. 1–21.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei P. Ershov Donald E. Knuth

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barzdin, J.M. (1981). On inductive synthesis of programs. In: Ershov, A.P., Knuth, D.E. (eds) Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11157-3_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-11157-3_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11157-3

  • Online ISBN: 978-3-540-38621-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics