ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics

2 code implementations • 24 Feb 2023 • Zhangir Azerbayev, Bartosz Piotrowski, Hailey Schoelkopf, Edward W. Ayers, Dragomir Radev, Jeremy Avigad

We introduce ProofNet, a benchmark for autoformalization and formal proving of undergraduate-level mathematics.

Abstract Algebra Automated Theorem Proving +2

Progress on a perimeter surveillance problem

no code implementations • 10 Aug 2020 • Jeremy Avigad, Floris van Doorn

We consider a perimeter surveillance problem introduced by Kingston, Beard, and Holt in 2008 and studied by Davis, Humphrey, and Kingston in 2019.

Elaboration in Dependent Type Theory

no code implementations • 16 May 2015 • Leonardo de Moura, Jeremy Avigad, Soonho Kong, Cody Roux

To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs.

Logic in Computer Science

Homotopy limits in type theory

1 code implementation • 2 Apr 2013 • Jeremy Avigad, Chris Kapulkin, Peter LeFanu Lumsdaine

Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant.

Logic Logic in Computer Science Category Theory 03B70, 55U35 D.2.4; F.4.1