Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1982: 6th Conference on Automated Deduction pp 194–208Cite as

Automatic construction of special purpose programs

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aho, A.V., Hopcroft, J.E., and Ullman, J.D.[1974], The design and analysis of computer algorithms, Addison-Wesley, Reading Mass., 1974, see Chapter 9: pp. 317–361

    Google Scholar 

  • Barstow, D.[1977], A knowledge based system for automatic program construction, Fifth International Joint Conference on Artificial Intelligence, Cambridge, August, 1977

    Google Scholar 

  • Beckeman, L., Haraldsson, A., Oskarsson, O., and Sandewall, E.[1976], A partial evaluator and its use as a programming tool, Artificial Intelligence Journal 7,1976, pp. 319–357

    Article  Google Scholar 

  • Burstall R.M., and Darlington, J. [1977], A transformation system for developing recursive programs,JACM, Vol. 24, No. 1, January 1977

    Google Scholar 

  • Emmanuelson, P. [1980], Performance enhancement in a well-structured pattern matcher through partial evaluation, Ph.D. Thesis, Software Systems Research Center, Linköping University, Linköping, Sweden, 1980

    Google Scholar 

  • Goad, C.[1982], Automatic construction of special purpose progroms,Stanford University Computer Science Dept. Report no. STAN-CS-82-897

    Google Scholar 

  • Knuth, D.E. [1968], The art of computer programming, vol 1: Fundamental algorithms, Addison-Wesley, Reading Mass., 1968, pp. 258–268

    Google Scholar 

  • Kreisel, G. [1981], Neglected possibilities for processing assertions and proofs mechanically: choice of problems and data, in: P. Suppes [ed.], University-level computer-assisted instruction at Stanford: 1968–1980. Stanford Calif.; Stanford University, Institute for Mathematical Studies in the Social Sciences, 1981

    Google Scholar 

  • Manna, Z., and Waldinger, R.[1980], A deductive approach to program synthesis, ACM Transactions on programming languages and systems, Vol. 2, No 1., January 1980

    Google Scholar 

  • Robson, J.[1979], The height of binary search trees, The Australian Computer Journal, 11(1979), pp 151–153

    Google Scholar 

  • Sproull, R.F.[1977], Strategy construction using a synthesis of heuristic and decision-theoretic methods,Xerox PARC technical report CSL-77-2, July, 1977

    Google Scholar 

  • Sutherland, I.E.,Sproull, R.F., and Schumacker, R.A.[1974], A characterization of ten hiddensurface algorithms,Computing Surveys, Vol. 6, No. 1, March 1974

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, USA

    Chris Goad

Authors
  1. Chris Goad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. W. Loveland

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Goad, C. (1982). Automatic construction of special purpose programs. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000060

Download citation

  • DOI: https://doi.org/10.1007/BFb0000060

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11558-8

  • Online ISBN: 978-3-540-39240-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation