2000 character limit reached
Canonical for Automated Theorem Proving in Lean (2504.06239v1)
Published 8 Apr 2025 in cs.LO
Abstract: Canonical is a solver for type inhabitation in dependent type theory, that is, the problem of producing a term of a given type. We present a Lean tactic which invokes Canonical to generate proof terms and synthesize programs. The tactic supports higher-order and dependently-typed goals, structural recursion over indexed inductive types, and definitional equality. Canonical finds proofs for 84% of Natural Number Game problems in 51 seconds total.
Collections
Sign up for free to add this paper to one or more collections.
