Bidirectional Type Checking
Bidirectional Type Checking is a type checking method that partitions typing judgments into two modes—checking and synthesis—where the former verifies a term against a known type and the latter deduces a type for a term, enabling more precise and modular inference in dependent type systems.
14
Publications
442
Citations
20
Authors
13
Institutions
Publications per year
2017–2026
4
Parents
14
Jana Dunfield, Frank Pfenning · 2004 · 84 citations · Full text
Termination checking with types
Andreas Abel · RAIRO - Theoretical Informatics and Applications · 2004 · 58 citations · Full text
Practical refinement-type checking
Rowan Davies, Frank Pfenning · 2005 · 44 citations
1–5 of 14
20
4
h-index
3
h-index
2
h-index
Max Planck Institute for Software Systems, Germany
2 publications · 96 citations
2
h-index
1
h-index
1–5 of 20
13
Carnegie Mellon University
Pittsburgh, United States
5 h-index
8 publications
317 citations
Max Planck Institute for Software Systems
Saarbrücken, Germany
3 h-index
5 publications
204 citations

McGill University
Montreal, Canada
2 h-index
3 publications
41 citations
Chalmers University of Technology
Gothenburg, Sweden
2 h-index
2 publications
85 citations

University of Gothenburg
Gothenburg, Sweden
1 h-index
1 publications
27 citations
IMDEA Software Institute
Pozuelo de Alarcón, Spain
1 h-index
1 publications
12 citations
University at Buffalo, State University of New York
Buffalo, United States
1 h-index
2 publications
24 citations

Buffalo State University
Buffalo, United States
1 h-index
2 publications
24 citations
1–8 of 13
PACMPL · 2 publications · 58 citations
2
h-index
ENTCS · 2 publications · 27 citations
2
h-index
ITA · 1 publications · 58 citations
1
h-index
Repository · 1 publications · 15 citations
1
h-index
1 publications · 11 citations
1
h-index
1–5