Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar

πŸ“… 2026-03-08
πŸ“ˆ Citations: 0
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
This work addresses the poor readability and maintainability of procedural apply-style proof scripts in Isabelle/HOL by introducing Apply2Isar, the first fully automated tool that translates fragile yet efficient apply-style scripts into clear, declarative Isar proofs. The approach leverages an analysis of Isabelle’s internal proof states, combined with syntax tree restructuring and abstraction of proof steps, to balance exploratory efficiency with robustness. Evaluated on a large-scale dataset from the Archive of Formal Proofs, Apply2Isar demonstrates its ability to generate high-quality, human-readable Isar proofs, significantly enhancing the maintainability and reusability of formal proofs.

Technology Category

Application Category

πŸ“ Abstract
In Isabelle/HOL, declarative proofs written in the Isar language are widely appreciated for their readability and robustness. However, some users may prefer writing procedural"apply-style"proof scripts since they enable rapid exploration of the search space. To get the best of both worlds, we introduce Apply2Isar, a tool for Isabelle/HOL that automatically converts apply-style scripts to declarative Isar. This allows users to write complex, possibly fragile apply-style scripts, and then automatically convert them to more readable and robust declarative Isar proofs. To demonstrate the efficacy of Apply2Isar in practice, we evaluate it on a large benchmark set consisting of apply-style proofs from the Isabelle Archive of Formal Proofs.
Problem

Research questions and friction points this paper is trying to address.

Isabelle/HOL
apply-style proofs
Isar
proof conversion
declarative proofs
Innovation

Methods, ideas, or system contributions that make the work stand out.

Apply2Isar
Isabelle/HOL
proof conversion
declarative proofs
apply-style proofs
πŸ”Ž Similar Papers
2023-03-27Bulletin of Symbolic LogicCitations: 2
S
Sage Binder
University of Iowa, Iowa City, IA, USA
H
Hanna Lachnitt
Stanford University, Stanford, CA, USA
Katherine Kosaian
Katherine Kosaian
Assistant Professor, University of Iowa
Formal VerificationTheorem Proving