Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,003,273 papers from all fields of science
Search
Sign In
Create Free Account
Rewriting
Known as:
Trace rewriting system
, Rewrite rules
, Rewrite system
Expand
In mathematics, computer science, and logic, rewriting covers a wide range of (potentially non-deterministic) methods of replacing subterms of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract rewriting system
Algebraic Petri net
Binary combinatory logic
Compiler
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Fast Abstractive Summarization with Reinforce-Selected Sentence Rewriting
Yen-Chun Chen
,
Mohit Bansal
Annual Meeting of the Association for…
2018
Corpus ID: 44129061
Inspired by how humans summarize long documents, we propose an accurate and fast summarization model that first selects salient…
Expand
Highly Cited
2007
Highly Cited
2007
On Translation,Rewriting and the Manipulation of Literary Fame
Ya-ping Chu
2007
Corpus ID: 57246149
Lefevere illustrates that translating is just rewriting.In this book he shows us the importance of rewriting and the necessity…
Expand
Highly Cited
2006
Highly Cited
2006
DAG-aware AIG rewriting: a fresh look at combinational logic synthesis
A. Mishchenko
,
S. Chatterjee
,
R. Brayton
43rd ACM/IEEE Design Automation Conference
2006
Corpus ID: 6086018
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the…
Expand
Review
2002
Review
2002
Term Rewriting Systems
Enno Ohlebusch
2002
Corpus ID: 60672302
In this chapter we will present the basic concepts of term rewriting that are needed in this book. More details on term rewriting…
Expand
Review
2002
Review
2002
Advanced Topics in Term Rewriting
Enno Ohlebusch
Springer: New York
2002
Corpus ID: 39474256
Unlike current survey articles and textbooks, here the so-called confluence and termination hierarchies play a key role…
Expand
Highly Cited
2000
Highly Cited
2000
Termination of term rewriting using dependency pairs
T. Arts
,
J. Giesl
Theoretical Computer Science
2000
Corpus ID: 16194384
Highly Cited
1998
Highly Cited
1998
Building program optimizers with rewriting strategies
E. Visser
,
Zine-El-Abidine Benaissa
,
A. Tolmach
ACM SIGPLAN International Conference on…
1998
Corpus ID: 2229500
We describe a language for defining term rewriting strategies, and its application to the production of program optimizers. Valid…
Expand
Highly Cited
1993
Highly Cited
1993
String-Rewriting Systems
R. V. Book
,
F. Otto
Text and Monographs in Computer Science
1993
Corpus ID: 1414442
In this chapter we introduce the string-rewriting systems and study their basic properties. Such systems are the primary subject…
Expand
Highly Cited
1980
Highly Cited
1980
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
G. Huet
Journal of the ACM
1980
Corpus ID: 10264997
This paper gives new results, and presents old ones m a umfied formahsm, concerning ChurchRosser theorems for rewrmng systems…
Expand
Highly Cited
1977
Highly Cited
1977
Conflunt reductions: Abstract properties and applications to term rewriting systems
G. Huet
18th Annual Symposium on Foundations of Computer…
1977
Corpus ID: 206558490
This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE