Term Rewriting

Term Rewriting is a formal method in symbolic computation and automated reasoning that specifies how expressions (terms) in a formal language are systematically transformed according to a set of directed equality rules, serving as a foundational mechanism for simplification, evaluation, and proof construction in theorem proving and proof assistants.

497

Publications

22K

Citations

602

Authors

287

Institutions

Publications per year

2017–2026

26

Authors

602

  1. JM
    José Meseguer

    University of Illinois Urbana-Champaign, United States

    17 publications · 1.3K citations

    16

    h-index

  2. CK
    Claude Kirchner

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

    17 publications · 519 citations

    13

    h-index

  3. JW
    Jan Willem Klop

    University of Amsterdam, Netherlands

    14 publications · 1.4K citations

    12

    h-index

  4. AM
    Aart Middeldorp

    University of Tsukuba, Japan

    15 publications · 455 citations

    12

    h-index

  5. HC
    Horatiu Cirstea

    Laboratoire Lorrain de Recherche en Informatique et ses Applications, France

    11 publications · 321 citations

    11

    h-index

1–5 of 602

Venues

  1. Electronic Notes in Theoretical Computer Science

    ENTCS · 52 publications · 1.6K citations

    24

    h-index

  2. Theoretical Computer Science

    37 publications · 2.7K citations

    23

    h-index

  3. Information and Computation

    17 publications · 773 citations

    15

    h-index

  4. Journal of Symbolic Computation

    19 publications · 794 citations

    14

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 18 publications · 343 citations

    13

    h-index

1–5