Dependent Types

Dependent Types is a type system feature in which types can depend on values, enabling the expression of precise invariants and facilitating formal verification through the Curry-Howard correspondence by allowing propositions to be represented as types and proofs as programs.

407

Publications

19.9K

Citations

479

Authors

208

Institutions

Publications per year

2017–2026

85

Authors

479

  1. LB
    Lars Birkedal

    Aarhus University, Denmark

    13 publications · 893 citations

    13

    h-index

  2. RH
    Robert Harper

    Carnegie Mellon University, United States

    13 publications · 684 citations

    12

    h-index

  3. SW
    Stephanie Weirich

    University of Pennsylvania, United States

    15 publications · 536 citations

    12

    h-index

  4. FP
    Frank Pfenning

    Carnegie Mellon University, United States

    11 publications · 1.4K citations

    11

    h-index

  5. CM
    Conor McBride

    University of Strathclyde, United Kingdom

    11 publications · 773 citations

    11

    h-index

1–5 of 479

Venues

  1. ACM SIGPLAN Notices

    35 publications · 1.1K citations

    18

    h-index

  2. Journal of Functional Programming

    22 publications · 1.6K citations

    17

    h-index

  3. Proceedings of the ACM on Programming Languages

    PACMPL · 26 publications · 738 citations

    17

    h-index

  4. Electronic Notes in Theoretical Computer Science

    ENTCS · 18 publications · 458 citations

    14

    h-index

  5. arXiv (Cornell University)

    Repository · 15 publications · 397 citations

    12

    h-index

1–5