Agda 2
- proof assistants
- languages
Agda 2, developed through work including Ulf Norell’s research, combines dependent types with functional programming and interactive proof development. Types may mention values, allowing a program’s interface to express properties more precise than a simple distinction between numbers and strings. The checker helps ensure that definitions meet those specifications under the language’s rules. Termination and totality are important when programs serve as proofs, so unrestricted computation and a consistent logical interpretation require different treatment. Agda is both a language and a research platform, with later extensions distinct from its initial release. **Timeline anchor:** 1 January 2007 CE. Year of release. **References:** [Source 1](https://en.wikipedia.org/wiki/Agda_(programming_language)).
Sources
Related
On other timelines
- Agda 2 develops practical elaboration for dependent types on Type theory · foundations, languages, proof assistants and program logics by @athan