Heterogeneous Proofs: Spider Diagrams meet Higher-Order Provers

Add to your list(s) Download to your calendar using vCal

• Matej Urbas (University of Cambridge)
• Tuesday 08 March 2011, 13:15-14:15
• Computer Laboratory, William Gates Building, Room SS03.

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:

• All Talks (aka the CURE list)
• 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
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• yk373's list

Note that ex-directory lists are not shown.