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
Parents
80
Introduction to Bisimulation and Coinduction
Davide Sangiorgi · Cambridge University Press eBooks · 2011 · 308 citations
Coinductive big-step operational semantics
Xavier Leroy, Hervé Grall · Information and Computation · 2008 · 179 citations
Andreas Abel, Brigitte Pientka, David Thibodeau et al. · 2013 · 104 citations
1–5 of 80
120
6
h-index
5
h-index
5
h-index
Institut national de recherche en sciences et technologies du numérique, France
4 publications · 517 citations
4
h-index
3
h-index
1–5 of 120
85

McGill University
Montreal, Canada
6 h-index
8 publications
577 citations
Université Claude Bernard Lyon 1
Villeurbanne, France
6 h-index
12 publications
386 citations

Centre National de la Recherche Scientifique
Paris, France
6 h-index
11 publications
291 citations
University of Oxford
Oxford, United Kingdom
5 h-index
6 publications
94 citations

Radboud University Nijmegen
Nijmegen, The Netherlands
5 h-index
6 publications
202 citations

University of Edinburgh
Edinburgh, United Kingdom
5 h-index
5 publications
263 citations
Ludwig-Maximilians-Universität München
Munich, Germany
5 h-index
5 publications
230 citations

École Normale Supérieure de Lyon
Lyon, France
5 h-index
10 publications
293 citations
1–8 of 85
ENTCS · 10 publications · 273 citations
10
h-index
MSCS · 6 publications · 316 citations
6
h-index
5 publications · 470 citations
5
h-index
5 publications · 94 citations
5
h-index
LMCS · 4 publications · 123 citations
4
h-index
1–5