![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 08 March 2011, 13:15-14:15
Heterogeneous Proofs: Spider Diagrams meet Higher-Order Provers
- đ¤ Speaker: Matej Urbas (University of Cambridge)
- đ Date & Time: Tuesday 08 March 2011, 13:15 - 14:15
- đ Venue: Computer Laboratory, William Gates Building, Room SS03
Questions? Contact
William Denman
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room SS03
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.