Autoformalization
Overview
Autoformalization translates informal mathematical statements, proofs, and software or scientific requirements into forms that proof assistants and solvers can check. Systems commonly combine language models with library retrieval, dependency-aware decomposition, and iterative feedback from Lean or Isabelle checkers, provers, model checkers, and tests. Benchmarks span competition and textbook mathematics, first-order logic, and executable software specifications, while agentic workflows increasingly tackle larger theories and research developments. The central challenge is semantic faithfulness: a formal artifact can compile or verify while misstating its source, so evaluation increasingly combines execution with equivalence checks, adversarial tests, and human review.
Latest papers
115 papers17 papers in the last four weeks, up 89% on the four weeks before. 0.1% of all new papers.