Equational Reasoning

Equational Reasoning is a formal method of logical inference in automated reasoning and theorem proving that relies on the substitution of equal terms according to provable or assumed equations within a functional programming context, distinguished by its foundation on the principle that equals can be replaced by equals in any context without altering the program's semantics.

252

Publications

15.9K

Citations

396

Authors

185

Institutions

Publications per year

2017–2026

30

Authors

396

  1. JM
    José Meseguer

    University of Illinois Urbana-Champaign, United States

    11 publications · 722 citations

    11

    h-index

  2. DK
    Dexter Kozen

    Cornell University, United States

    7 publications · 1.5K citations

    7

    h-index

  3. ND
    Nachum Dershowitz

    University of Illinois Urbana-Champaign, United States

    7 publications · 388 citations

    7

    h-index

  4. RH
    Ralf Hinze

    University of Bonn, Germany

    6 publications · 190 citations

    6

    h-index

  5. GP
    Gordon Plotkin

    University of Edinburgh, United Kingdom

    5 publications · 312 citations

    5

    h-index

1–5 of 396

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 13 publications · 670 citations

    11

    h-index

  2. Journal of Functional Programming

    12 publications · 295 citations

    11

    h-index

  3. Mathematical Structures in Computer Science

    MSCS · 9 publications · 282 citations

    9

    h-index

  4. Theoretical Computer Science

    7 publications · 777 citations

    7

    h-index

  5. Proceedings of the ACM on Programming Languages

    PACMPL · 8 publications · 292 citations

    7

    h-index

1–5