# A proof planning framework for Isabelle

@inproceedings{Dixon2006APP, title={A proof planning framework for Isabelle}, author={Lucas Dixon}, year={2006} }

- Published 2006

Proof planning is a paradigm for the automation of proof that focuses on encoding intelligence to guide the proof process. The idea is to capture common patterns of reasoning which can be used to derive abstract descriptions of proofs known as proof plans. These can then be executed to provide fully formal proofs. This thesis concerns the development and analysis of a novel approach to proof planning that focuses on an explicit representation of choices during search. We embody our approach as… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

Showing 1-10 of 26 extracted citations

## Inductive Proof Automation for Coq

View 10 Excerpts

Highly Influenced

## Aspects of the theory of containers within automated theorem proving

View 8 Excerpts

Highly Influenced

## Reasoning about correctness properties of a coordination programming language

View 6 Excerpts

Highly Influenced

## Verification of second-order functional programs

View 4 Excerpts

Highly Influenced

## Scheme-based theorem discovery and concept invention

View 5 Excerpts

## The Boyer-Moore Waterfall Model Revisited

View 2 Excerpts

## Automation for Dependently Typed Functional Programming

View 2 Excerpts

## Case-Analysis for Rippling and Inductive Proof

View 7 Excerpts

#### References

##### Publications referenced by this paper.

Showing 1-10 of 100 references

## Embeddings as a higher-order representation of annotations for rippling

View 20 Excerpts

Highly Influenced

## Rippling Meta-Level Guidance for Mathematical Reasoning: References

View 12 Excerpts

Highly Influenced

## The Dynamic Creation of Induction Rules Using Proof Planning

View 8 Excerpts

Highly Influenced

## How to Prove Inductive Theorems? QUODLIBET!

View 8 Excerpts

Highly Influenced

## User/Programmer Manual for the λClam proof planner

View 6 Excerpts

Highly Influenced

## Continuations of proof strategies

View 4 Excerpts

Highly Influenced

## Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain

View 6 Excerpts

Highly Influenced

## PDS — A Three-Dimensional Data Structure for Proof Plans

View 8 Excerpts

Highly Influenced

## The Zipper

View 4 Excerpts

Highly Influenced

## A calculus for and termination of rippling

View 17 Excerpts

Highly Influenced