Anatomy of a Lean proof for software engineers
- Lean: 4 events in the last 90 days
- Previous: 5 days earlier · Show HN: Spivak's Calculus formalized in Lean 4 – every theorem, every problem
What happened
Intro I recently worked through a problem from a theory of computation textbook that asked me to prove a property of a language using finite automata. The informal proof is a simple constructive proof where you build an automaton and show that it recognizes the language. This is kind of similar to program verification, so I thought it’d be interesting to see what it takes to formalize the proof. Lean is a good…
Summary assembled by rule from the sources below