Heterogeneous proofs: spider diagrams meet higher-order provers

Authors:
Matej Urbas;Mateja Jamnik
Affiliations:
University of Cambridge;University of Cambridge
Venue:
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Year:
2011

Citing 6
Cited 2

On Automating Diagrammatic Proofs of Arithmetic Arguments

Journal of Logic, Language and Information
Towards a Formalization of Constraint Diagrams

HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Automated Theorem Proving in Euler Diagram Systems

Journal of Automated Reasoning
Openproof - A Flexible Framework for Heterogeneous Reasoning

Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
The Isabelle Framework

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
The expressiveness of spider diagrams augmented with constants

Journal of Visual Languages and Computing

Speedith: a diagrammatic reasoner for spider diagrams

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
On the expressiveness of spider diagrams and commutative star-free regular languages

Journal of Visual Languages and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an interactive heterogeneous theorem proving framework, which performs formal reasoning by arbitrarily mixing diagrammatic and sentential proof steps. We use Isabelle to enable formal reasoning with either traditional sentences or spider diagrams. We provide a mechanisation of the theory of abstract spider diagrams and establish a formal link between diagrammatic concepts and the existing theories in Isabelle/HOL.