Skip to main content
SpringerLink
Log in

The Representation of Program Synthesis in Higher Order Logic

  • Conference paper
GWAI-90 14th German Workshop on Artificial Intelligence

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 251))

  • 56 Accesses

Abstract

Systems built for automated program construction aim at the formalization of the programming process in order to produce better software. Their implementations, however, suffer from problems similar to those they are intended to solve. Due to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. For that, systems capable of formal reasoning about both programs and programming methods are needed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Peter Andrews. An Introduction to mathematical logic and Type Theory: To Truth through Proof. Academic Press, Orlando, 1986.

    MATH  Google Scholar 

  2. Joe Bates and Robert L. Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113–136, January 1985.

    Article  MATH  Google Scholar 

  3. 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.

    MathSciNet  MATH  Google Scholar 

  4. Wolfgang Bibel and K. M. Hörnig. LOPS — a system based on a strategical approach to program synthesis. In A. Biermann, G. Guiho, and Y. KodratofF, editors, Automatic program construction techniques, chapter 3, pages 69–89. MacMillan, New York, 1984.

    Google Scholar 

  5. Wolfgang Bibel. Syntax-directed, semantics-supported program synthesis. Artificial Intelligence, 14(3):243–261, October 1980.

    Article  Google Scholar 

  6. Robert L. Constable, Stuart F. Allen, H. Mark Bromley, W. Ranee Cleaveland, J. F. Cremer, Robert W. Harper, Douglas J. Howe, Todd B. Knoblock, Nax Paul Mendler, Prakash Panangaden, Jim T. Sasaki, and Stuart F. Smith. Implementing Mathematics with the Nu PRL proof development system. Prentice Hall, 1986.

    Google Scholar 

  7. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Computation, 5:56–68, 1940.

    MathSciNet  MATH  Google Scholar 

  8. Nachum Dershowitz. Synthesis by completion. In IJCAI-85, pages 208–214, Los Angeles, 18–23 August 1985.

    Google Scholar 

  9. Edsger W. Dijkstra. A discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ, 1976.

    MATH  Google Scholar 

  10. Marta Franova. A methodology for automatic programming based on the constructive matching strategy. In EUROCAL 85, pages 568–570. Springer, 1985.

    Google Scholar 

  11. Michael J. Gordon, Robin Milner, and Christopher P. Wadsworth. Edinburgh LCF: A mechanized Logic of Computation. Springer Verlag, 1979.

    MATH  Google Scholar 

  12. David Gries.The science of programming. Springer Verlag, 1981.

    MATH  Google Scholar 

  13. C.J. Hogger. Derivation of logic programs. Journal of the Association for Computing Machinery, 28(2):372–392, 1981.

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  15. Zohar Manna and Richard Waldinger. Synthesis: Dreams => programs. IEEE Transactions of Software Engineering, SE-5(4):294–328, 1979.

    Google Scholar 

  16. Z. Manna and Richard Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2(1):90–121, 1980.

    Article  MATH  Google Scholar 

  17. Lawrence C. Paulson. The representation of logics in higher-order logic. Technical Report 113, University of Cambridge. Computer Laboratory, August 1987.

    Google Scholar 

  18. Douglas R. Smith and Michael R. Lowry. KIDS — a knowledge-based software development system. In Proc. AAAI Workshop on Automated Software Design, pages 129–136, August 1988.

    Google Scholar 

  19. Douglas R. Smith and Michael R. Lowry. Algorithm design and design tactics. In Proc. of the International Conference on the Mathematics of Program Construction, pages 379–398. Springer Verlag, June 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FG Intellektik — FB Informatik, Technische Hochschule Darmstadt, Alexanderstr 10, D-6100, Darmstadt, Deutschland

    Christoph Kreitz

Authors
  1. Christoph Kreitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. >c/o Danet GmbH, Pallaswiesenstr. 203, D-6100, Darmstadt, Deutschland

    Heinz Marburger

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreitz, C. (1990). The Representation of Program Synthesis in Higher Order Logic. In: Marburger, H. (eds) GWAI-90 14th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76071-6_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76071-6_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53132-6

  • Online ISBN: 978-3-642-76071-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation