Implementation of Proof Search in the Imperative Programming Language Pizza

Authors:
Christian Urban
Affiliations:
-
Venue:
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Year:
1998

Citing 2
Cited 2

Basic proof theory

Basic proof theory
Pizza into Java: translating theory into practice

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic

ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Web Interfaces for Proof Assistants

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

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.