Agda is a dependently typed functional programming language originally developed by Ulf Norell at Chalmers University of Technology with the help of Catarina Coquand, Thorsten Altenkirch, and Andrea Vezzosi. It is based on intuitionistic type theory, a form of constructive type theory, and has many similarities with Coq, another well-known proof assistant. Agda is developed using an interactive theorem proving approach.
Agda is a dependently typed language, meaning that types can depend on values. This allows for more precise specifications of programs and can lead to more robust programs. It also allows for more powerful type inference, meaning that the type checker can often infer the type of a program without the programmer having to explicitly annotate it.
Agda has an automatic termination checker, meaning that it can detect whether or not a program will terminate. This is a valuable property, as many programs that do not terminate can cause problems when run on a computer.
Agda is a functional programming language, meaning that programs are written as a series of function calls. This has a number of benefits, such as making programs easier to reason about and easier to parallelize.
Agda is also a statically typed language, meaning that the type of a program is checked before it is run. This can catch errors early, before they cause problems.
Agda is an open source project, released under the GNU Public License. The latest version, 2.5.3, was released on May 24, 2016.