Querying Proofs [chapter]

David Aspinall, Ewen Denney, Christoph Lüth
2012 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-642-28717-6_10 fatcat:uczu7tdy6jhbrehrf6recdtqie