A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
By: Arthur Ramos , Anjolina Oliveira , Ruy de Queiroz and more
We present Metatheory, a comprehensive library for programming language foundations in Lean 4. The library features a modular framework for proving confluence of abstract rewriting systems using three classical proof techniques: the diamond property, Newmans lemma, and the Hindley-Rosen lemma. These are instantiated across six case studies including untyped lambda calculus, combinatory logic, term rewriting, simply typed lambda calculus, and STLC with products and sums. All theorems are fully mechanized with zero axioms or sorry statements. We provide complete proofs of de Bruijn substitution infrastructure and demonstrate strong normalization via logical relations. To our knowledge, this is the first comprehensive confluence and normalization framework for Lean 4.
Similar Papers
CoLF Logic Programming as Infinitary Proof Exploration
Logic in Computer Science
Lets computers build complex proofs with infinite parts.
A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
Logic in Computer Science
Helps computers understand how programs work together.
A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
Logic in Computer Science
Helps programs check themselves for errors.