Skip to main content
SpringerLink
Log in

Automatic program optimization through proof transformation

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Aubin. Some generalization heuristics in proofs by induction. In G. Huet and G. Kahn, editors, Actes du Colloque Construction: Amélioration et vérification de Programmes. Institut de recherche d'informatique et d'automatique, 1975.

    Google Scholar 

  2. A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303–324, 1991.

    Google Scholar 

  3. A. Bundy, van Harmelen. F., C. Horn, and A. Smaill. The Oyster-Clam system. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647–648. Springer-Verlag, 1990. Lecture Notes in AI No.449.

    Google Scholar 

  4. R.M. Burstall and J. Darlington. A transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24(1):44–67, 1977.

    Google Scholar 

  5. W. N. Chin. Automatic Methods for Program Transformation. PhD thesis, University of London (Imperial College), 1990.

    Google Scholar 

  6. N. H. Cohen. Eliminating redundant recursive calls. volume 5 No. 3, pages 265–299. 1983.

    Google Scholar 

  7. H.B. Curry and R. Feys. Combinatory Logic. North-Holland, 1958.

    Google Scholar 

  8. J. Darlington. A Semantic Approach to Automatic Program Improvement. PhD thesis, Dept. of Artificial Intelligence, Edinburgh, 1972.

    Google Scholar 

  9. C. A. Goad. Computational uses of the manipulation of formal proofs. Technical report, Stanford University, 1980. STAN-CS-80-819.

    Google Scholar 

  10. C. A. Goad. Proofs as descriptions of computation. In Lecture Notes in Computer Science. Academic Press, 1980.

    Google Scholar 

  11. W.A. Howard. The formulae-as-types notion of construction. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry; Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479–490. Academic Press, 1980.

    Google Scholar 

  12. P. Madden. The specialization and transformation of. constructive existence proofs. In N.S. Sridharan, editor, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 1989. Also available from Edinburgh as DAI Research Paper 416.

    Google Scholar 

  13. P. Madden. Automated Program Transformation Through Proof Transformation. PhD thesis, University of Edinburgh, 1991.

    Google Scholar 

  14. Per Martin-Löf. Constructive mathematics and computer programming. In 6th International Congress for Logic, Methodology and Philosophy of Science, pages 153–175, Hanover, August 1979. North Holland, Amsterdam. 1982.

    Google Scholar 

  15. A. Pettorossi. A powerful strategy for deriving programs by transformation. In ACM Lisp and Functional Programming Conference, pages 405–426, 1984.

    Google Scholar 

  16. H. Tamaki and T. Sato. A transformation system for logic programs that preserves equivalence. Technical Report TR-018, ICOT, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, 80 South Bridge, EH1 1HN, Edinburgh, Scotland

    Peter Madden

Authors
  1. Peter Madden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madden, P. (1992). Automatic program optimization through proof transformation. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_183

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_183

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55602-2

  • Online ISBN: 978-3-540-47252-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation