Agda

Agda is a dependently typed functional programming language and proof assistant that extends the Calculus of Inductive Constructions with inductive-recursive definitions and strategic automation, distinguishing it from other interactive theorem provers by enabling the direct representation of proofs as programs with precise type-theoretic foundations.

104

Publications

3.1K

Citations

142

Authors

62

Institutions

Publications per year

2017–2026

30

Authors

142

  1. AA
    Andreas Abel

    Ludwig-Maximilians-Universität München, Germany

    15 publications · 511 citations

    13

    h-index

  2. TA
    Thorsten Altenkirch

    University of Nottingham, United Kingdom

    13 publications · 343 citations

    11

    h-index

  3. CM
    Conor McBride

    University of Strathclyde, United Kingdom

    10 publications · 324 citations

    10

    h-index

  4. AK
    Ambrus Kaposi

    Semmelweis University, Hungary

    6 publications · 169 citations

    6

    h-index

  5. NA
    Nils Anders Danielsson

    Chalmers University of Technology, Sweden

    5 publications · 126 citations

    5

    h-index

1–5 of 142

Venues

  1. ACM SIGPLAN Notices

    10 publications · 218 citations

    10

    h-index

  2. Proceedings of the ACM on Programming Languages

    PACMPL · 10 publications · 338 citations

    10

    h-index

  3. Journal of Functional Programming

    7 publications · 202 citations

    7

    h-index

  4. Logical Methods in Computer Science

    LMCS · 5 publications · 68 citations

    5

    h-index

  5. Electronic Notes in Theoretical Computer Science

    ENTCS · 5 publications · 97 citations

    5

    h-index

1–5