Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Rewriting

Known as: Trace rewriting system, Rewrite rules, Rewrite system 
In mathematics, computer science, and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a… Expand
Wikipedia

Related topics

Related topics

50 relations
Abstract rewriting systemAlgebraic Petri netBinary combinatory logicCompiler
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
All About Maude - A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Rewriting Logic
I: Core Maude.- Using Maude.- Syntax and Basic Parsing.- Functional Modules.- A Hierarchy of Data Types: From Trees to Sets… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Maude: specification and programming in rewriting logic
Maude is a high-level language and a high-performance system supporting executable specification and declarative programming in… Expand
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Term rewriting and all that
  • Chang Liu
  • SOEN
  • 2000
    • Corpus ID: 9343704
Term Rewriting and All That is a self-contained introduction to the field of term rewriting. The book starts with a simple… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Termination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Term rewriting and all that
Preface 1. Motivating examples 2. Abstract reduction systems 3. Universal algebra 4. Equational problems 5. Termination 6… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
String-Rewriting Systems
In this chapter we introduce the string-rewriting systems and study their basic properties. Such systems are the primary subject… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Handle-Rewriting Hypergraph Grammars
Abstract We introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacement of handles, i.e., of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Conditioned Rewriting Logic as a United Model of Concurrency
Abstract Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Term rewriting systems
From the Publisher: This book, the first on the subject in English, gives a readable but rigorous introduction to the theory of… Expand
  • figure 2.1
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
This paper gives new results, and presents old ones m a umfied formahsm, concerning ChurchRosser theorems for rewrmng systems… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE