Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
Sep 6, 2026 - Haskell
Agda is a dependently typed programming language / interactive theorem prover.
A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory
An introductory course to Homotopy Type Theory
Logical manifestations of topological concepts, and other things, via the univalent point of view.
Lecture notes on univalent foundations of mathematics with Agda
A curated set of links to formal methods involving provable code.
agda-mode for neovim
A toolkit for enforcing logical specifications on neural networks
Agda formalisation of the Introduction to Homotopy Type Theory
A SuperCompiler for Martin-Löf's Type Theory
To associate your repository with the agda topic, visit your repo's landing page and select "manage topics."