ERC Advanced Grant · 2021
Formalisation of Constructive Univalent Type Theory
There has been in the past 15 years remarkable achievements in the field of interactive theorem proving, both for checking complex software and checking non trivial mathematical proofs. For software correctness, X. Leroy (INRIA and College de France) has been leading since 2006 the CompCert project, with a fully verified C compiler. For mathematical proofs, these systems could handle complex arguments, such as the proof of the 4 color theorem or the formal proof of Feit-Thompson Theorem More recently, the Xena project, lead by K. Buzzard, is developing a large library of mathematical facts, and has been able to help the mathematician P. Scholze (field medalist 2018) to check a highly non…
From the public funding record at EU CORDIS. Describes the funded project, not the reviews below.