Canonical for Automated Theorem Proving in Lean
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915516769107968 |
|---|---|
| author | Norman, Chase Avigad, Jeremy |
| author_facet | Norman, Chase Avigad, Jeremy |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_06239 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Canonical for Automated Theorem Proving in Lean Norman, Chase Avigad, Jeremy Logic in Computer Science I.2.3; F.4.1 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. |
| title | Canonical for Automated Theorem Proving in Lean |
| topic | Logic in Computer Science I.2.3; F.4.1 |
| url | https://arxiv.org/abs/2504.06239 |