agda/agda

Health v2 · maintenance only

Flags: no_license

Adoption not part of the score

2920 stars · 427 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

Agda is a dependently typed functional programming language that doubles as an interactive theorem prover based on intuitionistic type theory. It features inductive families, mixfix operators, Unicode support, and an interactive Emacs interface for writing and checking proofs.

Use cases

• write and mechanically verify mathematical proofs
• learn dependent type theory and constructive mathematics
• develop provably correct programs with rich types
• formalize mathematics in a proof assistant
• teach courses on type theory and formal verification
• experiment with dependent types like length-indexed vectors

When to choose

• you need a proof assistant based on Martin-Löf type theory
• you want to program with dependent types and inductive families
• you prefer an interactive Emacs-driven proof development workflow
• you want a language similar to Rocq/Coq but with a more Haskell-like feel

When to avoid

• you need a general-purpose language for building applications
• you want automated theorem proving rather than interactive proof writing
• your team lacks experience with type theory or formal methods
• you need a large ecosystem of general-purpose libraries

Facets

application · maturity active

programming-language interpreter type-system compiler programming-languages mathematics education developer-tools windows cli cross-platform proof-assistant dependent-types type-theory interactive-theorem-prover constructive-mathematics haskell algorithms linux macos

Member repositories

For agents

markdown · JSON · MCP: product_card(name="agda/agda")