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.

  • The next Agda meeting, AIM XXVII is tentatively planned for end of May / beginning of June, maybe 4-9 June 2018.
  • The last Agda meeting, AIM XXVI, was held at Eötvös Loránd University in Budapest, Hungary, Monday 29th of January to Saturday 3rd of February 2018.
  • Past Agda Meetings.


  • (2017-09-11) The standard library 0.14 is now available.
  • (2017-09-08) Agda 2.5.3 is now available.

Getting started

Documentation and examples

Further information

Old/outdated stuff