|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Heterogeneous Proofs: Spider Diagrams meet Higher-Order Provers
If you have a question about this talk, please contact William Denman.
I will talk about my project of building an interactive heterogeneous theorem prover, which performs formal reasoning by arbitrarily mixing diagrammatic and sentential formulae/proof steps.
I use external tool integration with Isabelle to enable reasoning with spider diagrams. To achieve this, I also mechanised the theory of abstract spider diagrams—thus providing a formal link between diagrammatic concepts and the existing theories in Isabelle.
The ultimate goal, however, is to enable formal heterogeneous reasoning with other domain specific diagrammatic languages.
This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsType the title of a new list here Cambridge Science Festival Kuwait Foundation Lectures
Other talksGene regulation from a distance Francois Chatelet and the Spatial Turn in French Postwar Thought Mind Network Spring 2016 Functional links between splicing and transcription Multiscale Simulations for Soft Matter: Applications and New Developments To be confirmed: Verification and Automated Reasoning