# agda/agda

Agda is a dependently typed programming language / interactive theorem prover.

Repository: https://github.com/agda/agda
Canonical: https://ross.abutalabs.com/products/agda
Homepage: https://wiki.portal.chalmers.se/agda/pmwiki.php
Language: Haskell
License: NOASSERTION
License Family: other
Topics: dependent-types, programming-language, proof-assistant, agda, type-theory
Last push: 2026-08-26T21:23:28+00:00

## Health v2 (maintenance only)
Score: 67/100 (v2, computed 2026-09-03T02:20:16.233290+00:00)
- activity 99, release rhythm 8, longevity 100
- inputs: {"age_days": 4043, "days_push": 7, "days_rel": 424, "gap_med": 296, "n_releases_24m": 2}
- flags: no_license
- formula: round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10)

## Adoption (not part of the score)
Stars 2920, forks 427 (observed 2026-08-28T04:07:30.192852+00:00)

## What it is
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
- artifact type: application
- maturity: active
- function: programming-language, interpreter, type-system, compiler
- domain: programming-languages, mathematics, education, developer-tools
- platform: windows, cli, cross-platform
- tags: proof-assistant, dependent-types, type-theory, interactive-theorem-prover, constructive-mathematics, haskell, algorithms, linux, macos

## Member repositories
- agda/agda (main) score 67

## Provenance
- Observed fields: from GitHub, fetched 2026-08-28T04:07:30.192852+00:00.
- Health v2: computed from the inputs above; adoption is never an input.
- Inferred fields (summary, facets, guidance): AI-extracted, prompt v1, taxonomy v1, on 2026-08-30T07:33:50.943226+00:00, confidence not recorded.
  - readme: https://github.com/agda/agda (fetched 2026-08-28T04:07:30.192852+00:00, sha 235cbd188be8)
  - homepage: https://wiki.portal.chalmers.se/agda/pmwiki.php (fetched 2026-08-29T09:49:07.066160+00:00, sha ecc61d3aef6b)
  - site_page: https://wiki.portal.chalmers.se/agda/Main/Documentation (fetched 2026-08-29T09:49:07.075199+00:00, sha 6c8139e48bf9)
- Data as of 2026-08-30T08:39:29.467469+00:00.