
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.
FOS: Computer and information sciences, Dependent Type Theory, Automated Reasoning, Unification, Logic in Computer Science, Interactive Theorem Proving, Program Synthesis, Inhabitation, I.2.3; F.4.1, Formal Methods, Logic in Computer Science (cs.LO), ddc: ddc:004
FOS: Computer and information sciences, Dependent Type Theory, Automated Reasoning, Unification, Logic in Computer Science, Interactive Theorem Proving, Program Synthesis, Inhabitation, I.2.3; F.4.1, Formal Methods, Logic in Computer Science (cs.LO), ddc: ddc:004
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
