Abstract
Automated proof search can be easily implemented in logic programming languages. We demonstrate the technique of success continuations, which provides an equally simple method for encoding proof search in imperative programming languages. This technique is exemplified by developing an interpreter for the calculus G4ip in the language Pizza.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Carlsson. On Implementing Prolog in Functional Programming. New Generation Computing, pages 347–359, 1984.
R. Dyckhoff. Contraction-Free Sequent Calculi for Intuitionistic Logic. Journal of Symbolic Logic, 57(3):795–807, September 1992.
C. Elliott and F. Pfenning. A Semi-Functional Implementation of a Higher-Order Logic Programming Language. In P. Lee, editor, Topics in Advanced Language Implementation, pages 289–352. MIT Press, 1991.
J. Hodas and D. Miller. Logic Programming in a Fragment of Intuitionistic Linear Logic. Information and Computation, 110(2):327–365, 1994.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform Proofs as a Foundation for Logic Programming. Annals of Pure Applied Logic, 51:125–157, 1991.
M. Odersky and P. Wadler. Pizza into Java: Translating Theory into Practice. In Proc. 24th ACM Symposium on Principles of Programming Languages, January 1997.
A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Urban, C. (1998). Implementation of Proof Search in the Imperative Programming Language Pizza. In: de Swart, H. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 1998. Lecture Notes in Computer Science(), vol 1397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69778-0_31
Download citation
DOI: https://doi.org/10.1007/3-540-69778-0_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64406-4
Online ISBN: 978-3-540-69778-7
eBook Packages: Springer Book Archive