Interactive Theorem Proving

Overview

Interactive theorem proving develops proofs inside systems such as Lean, Isabelle, Coq/Rocq, Agda, and EasyCrypt, where a small trusted kernel checks each result. Common approaches include tactic search, SMT and automated theorem prover integration, and language-model agents that formalize problems, propose proof steps, and revise them using proof-state or compiler feedback. Benchmarks such as miniF2F, Putnam problems, and software-verification suites test these methods, while textbook formalizations and interactive tools also support mathematical understanding and teaching. Automation is becoming more capable, but reliable performance on unfamiliar, multi-step problems remains difficult, and proof acceptance alone does not guarantee faithful assumptions, authorized edits, or usable proof structure.

Latest papers

CardsList

34 papers3 papers in the last four weeks, down 40% on the four weeks before. 0.0% of all new papers.

  1. Neuro-Symbolic Proof Generation for Scaling Systems Software Verification

    Mar 20, 2026Baoding He, Zenan Li, Wei Sun +4Large Language Model-Guided Theorem ProvingAutomated Theorem Proving

  2. Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents

    Mar 6, 2026Chad E. Brown, Cezary Kaliszyk, Josef UrbanAutoformalizationMulti-Agent Collaboration

  3. Pipeline for Verifying LLM-Generated Mathematical Solutions

    Feb 24, 2026Varvara Sazonova, Dmitri Shmelkin, Stanislav Kikot +1LLM Answer VerificationLLM Evaluation

  4. When Agda met Vampire

    Feb 21, 2026Artjoms Šinkarovs, Michael RawsonInteractive Theorem ProvingAutomated Theorem Proving