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 modern proof language
A Proof-oriented Programming Language
A purely functional programming language with first class types
Agda is a dependently typed programming language / interactive theorem prover.
Lean Theorem Prover
A dependently-typed proof language intended to make provably correct bare metal code possible for working software engineers.
A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧
A fast functional language based on two level type theory
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
A Haskell library for typesafe music composition
An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
A proof assistant and a dependently-typed language
Proof assistant based on the λΠ-calculus modulo rewriting
🚧 (Alpha stage software) A declarative data definition language for formally specifying binary data formats. 🚧
A Compiler for the Popr Language
An in-progress fast, dependently typed, functional programming language implemented in Swift.
A function definition package for Coq
Lecture notes on univalent foundations of mathematics with Agda
CoqHammer: An Automated Reasoning Hammer Tool for Coq - Proof Automation for Dependent Type Theory
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."