A pipeline combining template-guided LLM informalization, a premise library, and structure-aware recursive summarization translates Lean proofs into natural language, scoring 0.857 key-point recall in a small author-conducted study.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Natural Language Translation of Formal Proofs through Informalization of Proof Steps and Recursive Summarization along Proof Structure
A pipeline combining template-guided LLM informalization, a premise library, and structure-aware recursive summarization translates Lean proofs into natural language, scoring 0.857 key-point recall in a small author-conducted study.