Lassie: HOL4 Tactics by Example

by   Heiko Becker, et al.

Proof engineering efforts using interactive theorem proving have yielded several impressive projects in software systems and mathematics. A key obstacle to such efforts is the requirement that the domain expert is also an expert in the low-level details in constructing the proof in a theorem prover. In particular, the user needs to select a sequence of tactics that lead to a successful proof, a task that in general requires knowledge of the exact names and use of a large set of tactics. We present Lassie, a tactic framework for the HOL4 theorem prover that allows individual users to define their own tactic language by example and give frequently used tactics or tactic combinations easier-to-remember names. The core of Lassie is an extensible semantic parser, which allows the user to interactively extend the tactic language through a process of definitional generalization. Defining tactics in Lassie thus does not require any knowledge in implementing custom tactics, while proofs written in Lassie retain the correctness guarantees provided by the HOL4 system. We show through case studies how Lassie can be used in small and larger proofs by novice and more experienced interactive theorem prover users, and how we envision it to ease the learning curve in a HOL4 tutorial.


page 1

page 2

page 3

page 4


GamePad: A Learning Environment for Theorem Proving

In this paper, we introduce a system called GamePad that can be used to ...

APML: An Architecture Proof Modeling Language

To address the increasing size and complexity of modern software systems...

A Linter for Isabelle: Implementation and Evaluation

In interactive theorem proving, formalization quality is a key factor fo...

Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs

The ever-growing complexity of mathematical proofs makes their manual ve...

From LCF to Isabelle/HOL

Interactive theorem provers have developed dramatically over the past fo...

Integrating Testing and Interactive Theorem Proving

Using an interactive theorem prover to reason about programs involves a ...

Explanation by Automated Reasoning Using the Isabelle Infrastructure Framework

In this paper, we propose the use of interactive theorem proving for exp...

Please sign up or login with your details

Forgot password? Click here to reset