Coinduction

Coinduction is a proof principle in theoretical computer science and mathematical logic that generalizes reasoning about infinite data structures and behaviors by characterizing them as fixed points of certain monotonic functions, distinguished from induction by its focus on greatest fixed points and observational equivalence rather than least fixed points and finite construction.

80

Publications

3.3K

Citations

120

Authors

85

Institutions

Publications per year

2017–2026

7

Authors

120

  1. AA
    Andreas Abel

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

    6 publications · 278 citations

    6

    h-index

  2. BP
    Brigitte Pientka

    McGill University, Canada

    5 publications · 260 citations

    5

    h-index

  3. DP
    Damien Pous

    École Normale Supérieure de Lyon, France

    5 publications · 165 citations

    5

    h-index

  4. DS
    Davide Sangiorgi

    Institut national de recherche en sciences et technologies du numérique, France

    4 publications · 517 citations

    4

    h-index

  5. BJ
    Bart Jacobs

    Radboud University Nijmegen, Netherlands

    3 publications · 239 citations

    3

    h-index

1–5 of 120

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 10 publications · 273 citations

    10

    h-index

  2. Mathematical Structures in Computer Science

    MSCS · 6 publications · 316 citations

    6

    h-index

  3. Information and Computation

    5 publications · 470 citations

    5

    h-index

  4. ACM SIGPLAN Notices

    5 publications · 94 citations

    5

    h-index

  5. Logical Methods in Computer Science

    LMCS · 4 publications · 123 citations

    4

    h-index

1–5