Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.
Inductively defined types
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The coq-paradoxes library mechanizes Burali-Forti, Diaconescu, Reynolds, and Hurkens paradoxes to specify the placement of impredicativity, large elimination restrictions, and universe discipline in Rocq's CIC kernel.
citing papers explorer
-
Automating Formal Verification with Agent-Guided Tree Search
Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.
-
Four Paradoxes and a Proof Assistant: Burali-Forti, Diaconescu, Reynolds, and Hurkens in the coq-paradoxes library
The coq-paradoxes library mechanizes Burali-Forti, Diaconescu, Reynolds, and Hurkens paradoxes to specify the placement of impredicativity, large elimination restrictions, and universe discipline in Rocq's CIC kernel.