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.
Review
2019
Review
2019
Ten Facts on Declining Business Dynamism and Lessons from Endogenous Growth Theory
In this paper, we review the literature on declining business dynamism and its implications in the United States and propose a… Expand
Review
2019
Review
2019
Multiple-Attribute Text Rewriting
The dominant approach to unsupervised “style transfer” in text is based on the idea of learning a latent representation, which is… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Review
2018
Review
2018
Solar Energy Potential Assessment on Rooftops and Facades in Large Built Environments Based on LiDAR Data, Image Processing, and Cloud Computing. Methodological Background, Application, and…
The paper presents the core methodology for assessing solar radiation and energy production on building rooftops and vertical… Expand
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
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
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
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
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
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
Highly Cited
1979
Highly Cited
1979
Orderings for Term-Rewriting Systems
Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification… Expand
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