Agda is a dependently typed programming language / interactive theorem prover.
-
Updated
Nov 29, 2024 - Haskell
Agda is a dependently typed programming language / interactive theorem prover.
An introductory course to Homotopy Type Theory
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.
Lecture notes on univalent foundations of mathematics with Agda
A curated set of links to formal methods involving provable code.
agda-mode for neovim
Agda formalisation of the Introduction to Homotopy Type Theory
A SuperCompiler for Martin-Löf's Type Theory
A workshop on learning Agda with minimal prerequisites.
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."