Abstract
I present a reformulation of the Whelk system [Wiggins 92b], as a higher-order type theory. The theory is based on that of [Martin-Löf 79], adapted to facilitate the extraction of logic programs from proof objects. A notion of normalization is used to ensure that the extracted program is executable by standard logic-programming methods. The extension admits specifications over types and programs, and so allows modularity and the construction of program combinators. In doing so, it demonstrates that logic program synthesis techniques have potential for solving “industrial-strength” problems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Bundy, A. Smaill, and J. Hesketh. Turning eureka steps into calculations in automatic program synthesis. In S.L.H. Clarke, editor, Proceedings of UK IT 90, pages 221–6, 1990. Also available from Edinburgh as DAI Research Paper 448.
A. Bundy, A. Smaill, and G. A. Wiggins. The synthesis of logic programs from inductive proofs. In J. Lloyd, editor, Computational Logic, pages 135–149. Springer-Verlag, 1990. Esprit Basic Research Series. Also available from Edinburgh as DAI Research Paper 501.
A. Bundy, F. van Harmelen, A. Smaill, and A. Ireland. Extensions to the rippling-out tactic for guiding inductive proofs. In M.E. Stickel, editor, 10th International Conference on Automated Deduction, pages 132–146. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449. Also available from Edinburgh as DAI Research Paper 459.
R.L. Constable. Programs as proofs. Technical Report TR 82-532, Dept. of Computer Science, Cornell University, November 1982.
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. Published by North Holland, Amsterdam. 1982.
G. A. Wiggins. Negation and control in automatically generated logic programs. In A. Pettorossi, editor, Proceedings of META-92. Springer Verlag, Heidelberg, 1992. LNCS Vol. 649.
G. A. Wiggins. Synthesis and transformation of logic programs in the Whelk proof development system. In K. R. Apt, editor, Proceedings of JICSLP-92, pages 351–368. M.I.T. Press, Cambridge, MA, 1992.
G. A. Wiggins, A. Bundy, I. Kraan, and J. Hesketh. Synthesis and transformation of logic programs through constructive, inductive proof. In K-K. Lau and T. Clement, editors, Proceedings of LoPSTr91, pages 27–45. Springer Verlag, 1991. Workshops in Computing Series.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiggins, G.A. (1994). Improving the Whelk system: A type-theoretic reconstruction. In: Fribourg, L., Turini, F. (eds) Logic Program Synthesis and Transformation — Meta-Programming in Logic. META LOPSTR 1994 1994. Lecture Notes in Computer Science, vol 883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58792-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-58792-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58792-7
Online ISBN: 978-3-540-49104-0
eBook Packages: Springer Book Archive