University of Cambridge > > Formalisation of mathematics with interactive theorem provers  > Structures in dependent type theory

Structures in dependent type theory

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

If you have a question about this talk, please contact Jonas Bayer.


Reasoning about axiomatically characterized abstract structures has been central to mathematics since the early twentieth century. The ability of Lean and its mathematical library, Mathlib, to manage a complex network of such structures has been essential to their acceptance by the mathematical community. In this talk, I will discuss some of the challenges that structural reasoning brings and how they are addressed in Lean and Mathlib. I will also discuss recent work by Joshua Clune, Yicheng Qian, and Alexander Bentkamp toward developing automated reasoning tools that work in such an environment.


WATCH ONLINE HERE : Meeting ID: 370 771 279 261 Passcode: iCo7a5

This talk is part of the Formalisation of mathematics with interactive theorem provers series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity