Structural Induction
Structural Induction is a proof method in mathematical logic and computer science that generalizes mathematical induction to recursively defined structures, such as trees or lists, by establishing a property holds for all minimal structures and that if it holds for immediate substructures, it holds for the structure built from them.
65
Publications
3.4K
Citations
112
Authors
52
Institutions
Publications per year
2017–2026
3
Parents
65
Proving Properties of Programs by Structural Induction
R. M. Burstall · The Computer Journal · 1969 · 327 citations
A new approach to abstract syntax involving binders
Murdoch J. Gabbay, Andrew M. Pitts · 2003 · 279 citations
Computing, Computer Science, Algebra +15
Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce et al. · 2008 · 218 citations · Full text
1–5 of 65
112
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 112
52
Stanford University
Stanford, United States
6 h-index
12 publications
696 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
7 publications
279 citations
University of Cambridge
Cambridge, United Kingdom
3 h-index
4 publications
681 citations
Northeastern University
Boston, United States
3 h-index
7 publications
651 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
3 publications
260 citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
3 publications
573 citations
AT&T (United States)
Bedminster, United States
2 h-index
3 publications
307 citations

Anhui University
Hefei, China
2 h-index
10 publications
380 citations
1–8 of 52
TSE · 4 publications · 67 citations
4
h-index
4 publications · 105 citations
4
h-index
Repository · 2 publications · 45 citations
2
h-index
2 publications · 59 citations
2
h-index
2 publications · 265 citations
2
h-index
1–5