Martin-Löf à la Coq
summary
A Coq formalization of Martin-Löf Type Theory (MLTT) that mechanizes its metatheory and proves decidability of conversion and of type checking using bidirectional type checking. The work produces a certified, executable type checker for MLTT with Π, Σ, ℕ, identity types and one universe, developed without impredicativity or extra axioms and using Coq features like universe polymorphism and tactics for a modular formalization.
AI-written summary · about