Querying Proofs

  title={Querying Proofs},
  author={David Aspinall and Ewen Denney and Christoph L{\"u}th},
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hierarchical nested labelled trees. The core language presented in this paper is locally structured, with queries built using recursion and patterns over proof structure and rule names. We define the syntax and semantics of locally structured queries, demonstrate their power, and sketch some implementation experiments. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-4 of 4 extracted citations

Hierarchical Proof transformation in HOL Light

Konrad Stojanowski
View 10 Excerpts
Highly Influenced

Capturing Hiproofs in HOL Light

MKM/Calculemus/DML • 2013
View 1 Excerpt


Publications referenced by this paper.

Similar Papers

Loading similar papers…