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 next-gen functional language
A Proof-oriented Programming Language
Lean Theorem Prover
Agda is a dependently typed programming language / interactive theorem prover.
A purely functional programming language with first class types
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
A Haskell library for typesafe music composition
Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
An in-progress fast, dependently typed, functional programming language implemented in Swift.
A Compiler for the Popr Language
Proof assistant based on the λΠ-calculus modulo rewriting
Lecture notes on univalent foundations of mathematics with Agda
A function definition package for Coq
An exhaustive list of all Rust resources regarding automated or semi-automated formalization efforts in any area, constructive mathematics, formal algorithms, and program verification.
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."