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

Authors

20

  1. JD
    Jana Dunfield

    Max Planck Institute for Software Systems, Germany

    4 publications · 195 citations

    4

    h-index

  2. FP
    Frank Pfenning

    Carnegie Mellon University, United States

    3 publications · 142 citations

    3

    h-index

  3. AA
    Andreas Abel

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

    2 publications · 85 citations

    2

    h-index

  4. NR
    Neelakantan R. Krishnaswami

    Max Planck Institute for Software Systems, Germany

    2 publications · 96 citations

    2

    h-index

  5. WL
    William Lovas

    Carnegie Mellon University, United States

    1 publications · 14 citations

    1

    h-index

1–5 of 20

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 58 citations

    2

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 27 citations

    2

    h-index

  3. RAIRO - Theoretical Informatics and Applications

    ITA · 1 publications · 58 citations

    1

    h-index

  4. MPG.PuRe (Max Planck Society)

    Repository · 1 publications · 15 citations

    1

    h-index

  5. ACM SIGPLAN Notices

    1 publications · 11 citations

    1

    h-index

1–5