A dependently typed functional programming language and proof assistant
  • Overview
  • Builds
  • Updates
  • Bugs
  • Contents
  • Changelog
  • Sources


Agda is a dependently typed functional programming language: it has inductive families, which are similar to Haskell's GADTs, but they can be indexed by values and not just types. It also has parameterized modules, mixfix operators, Unicode characters, and an interactive Emacs interface (the type checker can assist in the development of your code). Agda is also 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 and NuPRL.

Active Releases Overview

Release Latest Released Version Version in Testing
{{html release}} 
{{html stable_version}} {{html testing_version}}

Upstream Summary



Koji build Agda- signed with sigkey '34ec9cba'

Details 11 days ago - 2015-06-24 07:27:33


Koji build Agda- signed with sigkey '34ec9cba'

Details 12 days ago - 2015-06-23 18:58:32

sharkcz's Agda- failed to build (ppc)

Details 14 days ago - 2015-06-21 12:55:10

sharkcz's Agda- started building (ppc)

Details 14 days ago - 2015-06-21 12:54:02


Koji build Agda- signed with sigkey '34ec9cba'

Details 15 days ago - 2015-06-20 22:36:33

Found a bug? File a ticket. Note: There's some caching going on here. If you expect something and don't see it, check back in 5 minutes.

This Web Site is licensed under the GNU Affero General Public License. You may get sources for the current running code from these repositories: