Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
Jun 5, 2024 - Haskell
Agda is a dependently typed programming language / interactive theorem prover.
A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory
Logical manifestations of topological concepts, and other things, via the univalent point of view.
An introductory course to Homotopy Type Theory
agda-mode for neovim
Lecture notes on univalent foundations of mathematics with Agda
Agda grammar for tree-sitter
Formal specifications of the cardano ledger
A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
A SuperCompiler for Martin-Löf's Type Theory
Add a description, image, and links to the agda topic page so that developers can more easily learn about it.
To associate your repository with the agda topic, visit your repo's landing page and select "manage topics."