A lean formalization of From Linearity to Borrowing
- Source
- github.com
- Author
- empath75
- Date
Context
The From Linearity to Borrowing formalization translates a programming-language paper's proofs into Lean, a system that mechanically checks formal mathematical arguments. Its central termination result concerns closed programs that return a unit value, essentially a completion marker: for each program the formalized typing rules accept, some execution finishes and frees all the memory it allocated.
That scope matters. The repository documents changes to the paper's definitions and execution rules, restrictions on some results, and a lemma with no Lean declaration. It therefore offers an inspectable formal account with explicit departures from the printed paper. It does not establish termination for arbitrary software. Repository explanation
- The repository mechanizes the ACM paper From Linearity to Borrowing in Lean, following both the paper and its technical supplement as closely as the author could.
- According to the author, nearly every definition and lemma is covered, including the Fundamental Property and Adequacy, which roughly states that every well-typed program terminates with an empty heap.
- The author says Claude did almost all of the work over three to four weeks, as a spare-time project by someone unconnected to the paper's authors who is learning language design.
Checking sign-in…
Loading comments…

