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
Parents
104
Dependently typed programming in Agda
Ulf Norell · 2009 · 289 citations
Type theory in type theory using quotient inductive types
Thorsten Altenkirch, Ambrus Kaposi · 2016 · 86 citations · Full text
Productive coprogramming with guarded recursion
Robert Atkey, Conor McBride · 2013 · 77 citations
Dependently typed programming with singletons
Richard A. Eisenberg, Stephanie Weirich · 2012 · 74 citations
Wellfounded recursion with copatterns
Andreas Abel, Brigitte Pientka · 2013 · 71 citations
1–5 of 104
142
13
h-index
11
h-index
10
h-index
6
h-index
5
h-index
1–5 of 142
62
Chalmers University of Technology
Gothenburg, Sweden
11 h-index
23 publications
850 citations

University of Nottingham
Nottingham, United Kingdom
11 h-index
25 publications
695 citations

University of Gothenburg
Gothenburg, Sweden
10 h-index
13 publications
372 citations

University of Strathclyde
Glasgow, United Kingdom
10 h-index
16 publications
553 citations

IT University of Copenhagen
Copenhagen, Denmark
5 h-index
6 publications
184 citations
KU Leuven
Leuven, Belgium
5 h-index
12 publications
357 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
5 h-index
6 publications
120 citations

University of Edinburgh
Edinburgh, United Kingdom
4 h-index
5 publications
151 citations
1–8 of 62
10 publications · 218 citations
10
h-index
PACMPL · 10 publications · 338 citations
10
h-index
7 publications · 202 citations
7
h-index
LMCS · 5 publications · 68 citations
5
h-index
ENTCS · 5 publications · 97 citations
5
h-index
1–5