![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Formalizing compositional proofs
Formalizing compositional proofsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Paul Taylor. I will present a new proof assistant, Globular, which allows the formalization of compositional proofs in higher category theory. The interface is geometrical, with proofs depicted as string diagrams, and allowing direct click-and-drag manipulation. I will show how to build a simple proof from scratch, and present some sophisticated formalized proofs from topology and algebra. I will also give some details of the theoretical basis. This talk will be accessible, and will not require any previous knowledge of category theory. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsAlgebra Reading Group on Sporadic Groups Applied Mathematics Seminar Series Type the title of a new list hereOther talksParameter estimation for macroscopic pedestrian dynamics models using trajectory data The Electron-Ion Collider Title tbc Kneser Graphs are Hamiltonian Time crystals, time quasicrystals, and time crystal dynamics TBA |