Skip to main content
SpringerLink
Log in

A methodology for automatic programming based on the constructive matching strategy

  • Automatic Programming II
  • Conference paper
  • First Online:
EUROCAL '85 (EUROCAL 1985)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. J. Arsac, Y. Kodratoff: Some Techniques for Recursion Removal from Recursive Function; ACM Transactions on Programming Languages and Systems, Vol. 4, No. 2, April 1982, pp. 295–322.

    Google Scholar 

  2. W. Bibel, K.M. Hornig: LOPS — A System Based on a Strategical Approach to Program Synthesis: in: A.W. Bierman, G. Guiho, Y. Kodratoff (eds.): Automatic Program Construction Techniques; Macmillan Publishing Company, London 1984, 69–91.

    Google Scholar 

  3. R.S. Boyer, J.S. Moore: A Computational Logic; Academic Press, 1979.

    Google Scholar 

  4. J. Darlington: The Dessign of Efficient Data Representations; in A.W. Bierman, G. Guiho, Y. Kodratoff (eds.): Automatic Program Construction Techniques; Macmillan Publishing Company, London 1984, pp. 139–159.

    Google Scholar 

  5. M. Fraňovd: CM — Strategy — Driven Deductions for Automatic Programming; in T. O'Shea (ed.): ECAI.84: Advances in Artificial Intelligence, Elsevier Science Publishers B.V. (North-Holland), 1984, pp. 573–576.

    Google Scholar 

  6. G.Kreisel: Neglected Possibilities of Processing Assertions and Proofs Mechanically: Choice of Problems and Data; in P.Suppes,ed.: University-Level Computer-Assisted Instruction at Stanford: 1968–1980; Stanford University, 1981, pp. 131–148.

    Google Scholar 

  7. Z. Manna and R. Waldinger: A Deductive Approach to Program Synthesis; ACM Transactions on Programming Languages and Systems, Vol. 2., No. 1, January 1980, pp. 90–121.

    Article  Google Scholar 

  8. P. Martin-Lof: Constructive Mathematics and Computer programming; read at the 6-th International Congress for Logic, Methodology of Science, Hannover 1979.

    Google Scholar 

  9. R.D. Smith: Top-Down Synthesis of Simple Divide and Conquer Algorithm; Technical Report NPS52-82-011, Naval Postgraduate School, Monterey, CA 93940, November 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, Bât.490, 91405, Orsay, France

    Marta Fraňová

Authors
  1. Marta Fraňová
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bob F. Caviness

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fraňová, M. (1985). A methodology for automatic programming based on the constructive matching strategy. In: Caviness, B.F. (eds) EUROCAL '85. EUROCAL 1985. Lecture Notes in Computer Science, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15984-3_330

Download citation

  • DOI: https://doi.org/10.1007/3-540-15984-3_330

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15984-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation