Skip to main content

An algebraic framework for inductive program synthesis

  • Lectures
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

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

  • 150 Accesses

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. Angluin, Dana / Smith, C.H. A survey of inductive inference: theory and methods, Computing Surveys 15 (1983) 3, 238–269

    Google Scholar 

  2. Bergstra, Jan A. / Meyer, J.-J.Ch. On specifying sets of integers, EIK 20 (1984) 10/11, 531–541

    Google Scholar 

  3. Bergstra, Jan / Tucker, J.V. A natural data type with finite equational final semantics specification but no effective equational initial semantics specification, Bull. EATCS 11 (1980), 23–33

    Google Scholar 

  4. Burstall, Rod / Goguen, J. The semantics of CLEAR, a specification language, in: Abstract Software Specifications (D. Bjorner, ed.), Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1979 (Lecture Notes in Computer Sciences 86)

    Google Scholar 

  5. CIP Language Group The Munich Project CIP, Volume 1: The Wide Spectrum Language CIP-L, Springer — Verlag, Berlin-Heidelberg-New York-Tokyo, 1985 (Lecture Notes in Computer Science 183)

    Google Scholar 

  6. Ehrig, Hartmut / Mahr, B. Fundamentals of Algebraic Specification 1, Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1985 (EATCS Monographs on Theoretical Computer Science 6)

    Google Scholar 

  7. Goguen, J.A. / Thatcher, J.W. / Wagner, E.G. An initial algebra approach to the specification, correctness, and implementation of abstract data types, in: Current Trends in Programming Methodology, R.T. Yeh (ed.), Prentice-Hall, 1978, 80–149

    Google Scholar 

  8. Gold, E. Mark Language identification in the limit, Inf. and Control 10 (1967), 447–474

    Google Scholar 

  9. Guttag, John V. The specification and application to programming of abstract data types, Ph. D. Thesis, Univ. of Toronto, 1975

    Google Scholar 

  10. Horning, J.J. Combining algebraic specifications in LARCH, in: Formal Methods and Software Development, Vol. 2, H. Ehrig / Ch. Floyd / M. Nivat / J. Thatcher (eds.), Springer-Verlag, Berlin — Heidelberg-New York-Tokyo, 1985 (Lecture Notes in Computer Science 186), 12–26

    Google Scholar 

  11. Jantke, Klaus P. A characterization theorem on partial recursive functions and abstract data types, Bull. EATCS 15 (1981), 40–46

    Google Scholar 

  12. Jantke, Klaus P. A generalized approach to inductive inference in: Artificial intelligence and information — control system of robots, I. Plander (ed.), North-Holland, 1984, 189–192

    Google Scholar 

  13. Jantke, Klaus P. The main proof theoretic problems in inductive inference, in: Frege Conference 1984, G. Wechsung (ed.), Akademie-Verlag Berlin, 1984, 321–330

    Google Scholar 

  14. Jantke, Klaus P. Program synthesis by analogy — a two-phased approach, in: Proc. AIMSA'84, W. Bibel / B. Petkoff (eds.), North-Holland, 1985

    Google Scholar 

  15. Jantke, Klaus P. The recursive power of algebraic semantics, submitted to EIK

    Google Scholar 

  16. Klaeren, Herbert A. Algebraische Spezifikationen — Eine Einfuehrung, Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1983

    Google Scholar 

  17. Klette, Reinhard / Wiehagen, R. Research in the theory of inductive inference by GDR mathematicians — a survey, Inf. Sciences 22 (1980), 149–169

    Google Scholar 

  18. Naur, P. Intuition in software development, in: Formal Methods and Software Development, Vol. 2, H. Ehrig / Ch. Floyd / M. Nivat / J. Thatcher (eds.), Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1985 (Lecture Notes in Computer Science 186), 60–79

    Google Scholar 

  19. Nix, Robert P. Editing by example, Yale University, New Haven, Dep. Comp. Sci., Techn. Report 280, 1983

    Google Scholar 

  20. Parnas, D.L. / Clements, P.C. A rational design process: how and why to fake it, in: Formal Methods and Software Development, Vol. 2, H. Ehrig / Ch. Floyd / M. Nivat / J. Thatcher (eds.), Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1985 (Lecture Notes in Computer Science 186), 80–100

    Google Scholar 

  21. Reichel, Horst Structural induction on partial algebras Akademie-Verlag, Berlin, 1984 (Mathematical Research 18)

    Google Scholar 

  22. Sannella, Don / Wirsing, M. A kernel language for algebraic specification and implementation, Proc. FCT 1983, Bergholm

    Google Scholar 

  23. Trakhtenbrot, B.A. / Barzdin, J.M. Frinite Automata: Behaviour and Synthesis, North-Holland, 1974

    Google Scholar 

  24. Wand, Mitchel Final algebra semantics and data type extensions, J. Computer Syst. Sci. 19 (1979), 27–44

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jantke, K.P. (1986). An algebraic framework for inductive program synthesis. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics