Core Concepts
LeanSSR provides a powerful proof scripting language that enhances usability, expressivity, and extensibility for working with Lean 4.
Abstract
Vladimir Gladshtein, George Pîrlea, and Ilya Sergey from the School of Computing at the National University of Singapore present the design and implementation of Small Scale Reflection (SSR) for Lean 4.
SSR methodology focuses on structuring machine-assisted proofs using symbolic representations alongside logical definitions.
LeanSSR improves on Coq's SSReflect by offering more fine-grained access to proof states and seamless combination of deduction steps with computation.
The paper showcases the utility of LeanSSR through case studies porting Coq lemmas to Lean and re-implementing proofs in mathlib4.
Features like intro patterns, rewrite patterns, and custom environment extensions enhance the functionality and modularity of LeanSSR.
Stats
Lean assumes axioms of classical logic like excluded middle. (Line: 29)
Lean encourages reflecting proofs about decidable propositions into Boolean-returning computations. (Line: 33)
Quotes
"Lean encourages the use of propositions as if they were Boolean expressions." - Line: 33