Coq is a formal proof management system. It provides a formal language to write mathematical definitions, executable algorithms and theorems together with an environment for semi-interactive development of machine-checked proofs.
A garden of small programming language implementations 🪴
Proof assistant based on the λΠ-calculus modulo rewriting
Language mixing functional programming and Ambient Calculus
🧊 Модальний гомотопічний верифікатор математики
Contextual types meet mechanized metatheory!
CoqHammer: An Automated Reasoning Hammer Tool for Coq - Proof Automation for Dependent Type Theory
Minimal core language based on dependent function type, pair type, recursive type, sum type and record type.
Anders: Cubical Type Checker
Blazingly type safe GPU accelerated Multi-Layer Perceptron
Castle Bravo: Experimental HoTT Implementation
An implementation of dependently typed lambda calculus
ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
Hurricane: HoTT-I Type System
A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
Type checker for pure MLTT using well-scoped de Bruijn indices
A type checker for FreshMLTT, a dependent type theory with abstractable names together with an equational characterisation of freshness.
Add a description, image, and links to the dependent-types topic page so that developers can more easily learn about it.
To associate your repository with the dependent-types topic, visit your repo's landing page and select "manage topics."