Proof Irrelevance

Proof Irrelevance is a type-theoretic principle asserting that all proofs of the same proposition are indistinguishable and thus reduce to a single canonical form, regardless of their syntactic differences.

10

Publications

389

Citations

14

Authors

13

Institutions

Publications per year

2017–2026

2

Authors

14

  1. FP
    Frank Pfenning

    Carnegie Mellon University, United States

    2 publications · 187 citations

    2

    h-index

  2. NR
    Neelakantan R. Krishnaswami

    Max Planck Institute for Software Systems, Germany

    2 publications · 69 citations

    2

    h-index

  3. NB
    Nick Benton

    Microsoft Research (United Kingdom), United Kingdom

    2 publications · 69 citations

    2

    h-index

  4. BT
    Bernardo Toninho

    Imperial College London, United Kingdom

    2 publications · 102 citations

    2

    h-index

  5. FB
    Franco Barbanera

    University of Turin, Italy

    1 publications · 11 citations

    1

    h-index

1–5 of 14

Venues

  1. Proceedings of the ACM on Programming Languages

    PACMPL · 2 publications · 71 citations

    2

    h-index

  2. 1

    h-index

  3. Journal of Functional Programming

    1 publications · 11 citations

    1

    h-index

  4. Logical Methods in Computer Science

    LMCS · 1 publications · 11 citations

    1

    h-index

  5. ACM SIGPLAN Notices

    1 publications · 19 citations

    1

    h-index

1–5