Shallow lazy proofs

Authors:
Hasan Amjad
Affiliations:
Computer Laboratory, University of Cambridge, Cambridge, UK
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 4
Cited 1

Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
The Definition of Standard ML

The Definition of Standard ML
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Proof Generation in the Touchstone Theorem Prover

CADE-17 Proceedings of the 17th International Conference on Automated Deduction

Shared-memory multiprocessing for interactive theorem proving

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that delaying fully-expansive proof reconstruction for non-interactive decision procedures can result in a more efficient work-flow. In contrast with earlier work, our approach to postponed proof does not require making deep changes to the theorem prover.