Agda is a dependently typed functional programming language and proof assistant originally developed at Chalmers University of Technology, with its current version, Agda 2, a full rewrite considered a programming language in its own right. It is based on intuitionistic type theory, and its type system is expressive enough to support full functional programs as well as their formal correctness proofs, in the tradition of the Curry-Howard correspondence.
Facts
First Released SignificanceDependently typed functional language and proof assistant 1 Connections
Influenced By
Agda infobox lists Haskell under "Influenced by"; "a Haskell-like syntax." en.wikipedia.org/wiki/Agda_(programming_language)
Sources
1. Agda (Wikipedia)
Lead paragraph, history
The original Agda system was developed at Chalmers by Catarina Coquand in 1999
Lead paragraph, description
Agda is a dependently typed functional programming language
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.