Agda is a dependently typed functional programming language. It has inductive families, i.e., data types which depend on values, such as the type of vectors of a given length. It also has parametrised modules, mixfix operators, Unicode characters, and an interactive Emacs interface which can assist the programmer in writing the program.

Agda is a proof assistant. It is an interactive system for writing and checking proofs. Agda is based on intuitionistic type theory, a foundational system for constructive mathematics developed by the Swedish logician Per Martin-Löf. It has many similarities with other proof assistants based on dependent types, such as Coq, Epigram, Matita and NuPRL.

Agda is open-source and enjoys contributions from many authors. The center of the Agda development is the Programming Logic group at Chalmers and Gothenburg University. The main developers are Ulf Norell, Nils Anders Danielsson, and Andreas Abel.

Agda meetings

Agda users and implementors meet biannually for a week of talks and code sprints.


  • (2018-07-19) Agda is now available.
  • (2018-06-08) The standard library 0.16 is now available.
  • (2018-06-02) Agda 2.5.4 is now available.
  • (2018-03-12) The standard library 0.15 is now available.
  • (2017-09-08) Agda 2.5.3 is now available.

Getting started

Documentation and examples

Further information

Old/outdated stuff