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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Peter Andrews. An Introduction to mathematical logic and Type Theory: To Truth through Proof. Academic Press, Orlando, 1986.
Joe Bates and Robert L. Constable. Proofs as programs. ACM Transactions on Programming Languages and Systems, 7(1):113–136, January 1985.
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.
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.
Wolfgang Bibel. Syntax-directed, semantics-supported program synthesis. Artificial Intelligence, 14(3):243–261, October 1980.
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.
Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Computation, 5:56–68, 1940.
Nachum Dershowitz. Synthesis by completion. In IJCAI-85, pages 208–214, Los Angeles, 18–23 August 1985.
Edsger W. Dijkstra. A discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ, 1976.
Marta Franova. A methodology for automatic programming based on the constructive matching strategy. In EUROCAL 85, pages 568–570. Springer, 1985.
Michael J. Gordon, Robin Milner, and Christopher P. Wadsworth. Edinburgh LCF: A mechanized Logic of Computation. Springer Verlag, 1979.
David Gries.The science of programming. Springer Verlag, 1981.
C.J. Hogger. Derivation of logic programs. Journal of the Association for Computing Machinery, 28(2):372–392, 1981.
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.
Zohar Manna and Richard Waldinger. Synthesis: Dreams => programs. IEEE Transactions of Software Engineering, SE-5(4):294–328, 1979.
Z. Manna and Richard Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2(1):90–121, 1980.
Lawrence C. Paulson. The representation of logics in higher-order logic. Technical Report 113, University of Cambridge. Computer Laboratory, August 1987.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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