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 parameterised 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.

","plain":"Agda is a dependently typed functional programming language: it has inductive\nfamilies, which are similar to Haskell's GADTs, but they can be indexed by\nvalues and not just types. It also has parameterised modules, mixfix operators,\nUnicode characters, and an interactive Emacs interface (the type checker can\nassist in the development of your code). Agda is also a proof assistant: it is\nan interactive system for writing and checking proofs. Agda is based on\nintuitionistic type theory, a foundational system for constructive mathematics\ndeveloped by the Swedish logician Per Martin-Löf. It has many similarities with\nother proof assistants based on dependent types, such as Coq, Epigram and NuPRL.\n\n","locale":"en_US.UTF-8"},"home-page":"https://wiki.portal.chalmers.se/agda/","derivations":[{"system":"x86_64-linux","target":"","derivation":"/gnu/store/wl8dd2pkgfiani9xvg68hl40p1wcavcc-agda-2.6.2.1.drv"},{"system":"i686-linux","target":"","derivation":"/gnu/store/pfdxdpzala3s4v9l0v77qj57kynih6vq-agda-2.6.2.1.drv"}]}