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

Authors

112

  1. AM
    Andrew M. Pitts

    University of Cambridge, United Kingdom

    4 publications · 414 citations

    4

    h-index

  2. RA
    Raymond Aubin

    Concordia University, Canada

    3 publications · 73 citations

    3

    h-index

  3. JV
    Jean Vuillemin

    Université Paris-Sud, France

    3 publications · 181 citations

    3

    h-index

  4. ZM
    Zohar Manna

    Stanford University, United States

    3 publications · 181 citations

    3

    h-index

  5. SN
    Stephen Ness

    Stanford University, United States

    3 publications · 181 citations

    3

    h-index

1–5 of 112

Venues

  1. IEEE Transactions on Software Engineering

    TSE · 4 publications · 67 citations

    4

    h-index

  2. ACM SIGPLAN Notices

    4 publications · 105 citations

    4

    h-index

  3. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 2 publications · 45 citations

    2

    h-index

  4. Journal of Functional Programming

    2 publications · 59 citations

    2

    h-index

  5. Information and Computation

    2 publications · 265 citations

    2

    h-index

1–5