An introduction to programming language theory in Agda

The Agda standard library

An experimental library for Cubical Agda

Development of homotopy type theory in Agda

A formalised, cross-linked reference resource for mathematics done in Homotopy Type Theory

A new Categories library for Agda

Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations

An introductory course to Homotopy Type Theory

The agda-unimath library

Logical manifestations of topological concepts, and other things, via the univalent point of view.

Lecture notes on univalent foundations of mathematics with Agda

Compiling Agda code to readable Haskell

Categories parametrized by morphism equality, in Agda

Programming library for Agda

Total Parser Combinators in Agda

Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT

Agda formalisation of the Introduction to Homotopy Type Theory

Agda bindings to SMT-LIB2 compatible solvers.

The theory of algebraic graphs formalised in Agda

A workshop on learning Agda with minimal prerequisites.

Algebra of Programming in Agda: Dependent Types for Relational Program Derivation

Abstract binding trees (abstract syntax trees plus binders), as a library in Agda

A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs

A formalization of the polymorphic lambda calculus extended with iso-recursive types

Inline, type safe X86-64 assembly programming in Agda

Summer school on programming in Agda

Miller/pattern unification in Agda

A cost-aware logical framework, embedded in Agda.

This aims to be the most pretentious implementation of stlc in existence

Refinement types + dependent types = ❤️