lambdapi
lambdapi is a proof assistant and interactive theorem prover designed for formalizing mathematics within a dependent type theory. It is based on the lambda-Pi calculus modulo rewriting, a framework that extends the standard dependent lambda calculus with user-defined rewrite rules integrated into type-checking. This design enables compact formalizations and flexible reasoning while maintaining soundness through a trusted kernel.
Its core features include a dependent type system with Pi-types, universes, and higher-order abstraction, together with
lambdapi is used in research on type theory and the formalization of mathematics. It is associated with