Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
May 28, 2024 - Haskell
Agda is a dependently typed programming language / interactive theorem prover.
Programming Language Theory λΠ
Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)
Lean Theorem Prover
A Coq library for Homotopy Type Theory
A next-gen functional language
Experimental implementation of Cubical Type Theory
Logical manifestations of topological concepts, and other things, via the univalent point of view.
A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧
The People's Refinement Logic
Programming language agnostic type construction language based on polynomials.
Lecture notes on univalent foundations of mathematics with Agda
Research on integrating datalog & lambda calculus via monotonicity types
😎TT
A research project in path semantics, a re-interpretation of functions for expressing mathematics
"Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
My personal repository of formally verified mathematics.
List of resources about foundational knowledge for programmers (supposed to last a few decades)
A SuperCompiler for Martin-Löf's Type Theory
Add a description, image, and links to the type-theory topic page so that developers can more easily learn about it.
To associate your repository with the type-theory topic, visit your repo's landing page and select "manage topics."