Notational definition and top-down refinement for interactive proof development systems
Notational definition and top-down refinement for interactive proof development systems
An overview of the Tecton proof system
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
ICCS '93 Proceedings on Conceptual Graphs for Knowledge Representation
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
A computational architecture for heterogeneous reasoning
Journal of Experimental & Theoretical Artificial Intelligence
Merging Procedural and Declarative Proof
Types for Proofs and Programs
Hiproofs: A Hierarchical Notion of Proof Tree
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards formal proof script refactoring
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Importing HOL into Isabelle/HOL
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Challenges and experiences in managing large-scale proofs
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
Hierarchical proof trees (hiproofs for short) add structure to ordinary proof trees, by allowing portions of trees to be hierarchically nested. The additional structure can be used to abstract away from details, or to label particular portions to explain their purpose. In this paper we present two complementary methods for capturing hiproofs in HOL Light, along with a tool to produce web-based visualisations. The first method uses tactic recording, by modifying tactics to record their arguments and construct a hierarchical tree; this allows a tactic proof script to be modified. The second method uses proof recording, which extends the HOL Light kernel to record hierachical proof trees alongside theorems. This method is less invasive, but requires care to manage the size of the recorded objects. We have implemented both methods, resulting in two systems: Tactician and HipCam.