(redirected from Term rewriting)
Also found in: Thesaurus.
Related to Term rewriting: Rewrite system


v. re·wrote (-rōt′), re·writ·ten (-rĭt′n), re·writ·ing, re·writes
1. To write again, especially in a different or improved form; revise.
2. To put (material submitted to a newspaper or magazine) in a form suitable for publishing.
3. Computers To save (a usually altered file) over its most recent version in the same storage location.
To make revisions in written material.
n. (rē′rīt′)
1. The act or an instance of rewriting.
2. Something rewritten.

re·writ′a·ble, re·write′a·ble adj.
re·writ′er n.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.rewriting - editing that involves writing something again
editing, redaction - putting something (as a literary work or a legislative bill) into acceptable form
revisal, revise, revision, rescript - the act of rewriting something
recasting, rephrasing, rewording - changing a particular word or phrase
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.
References in periodicals archive ?
Narrowing [53-55] is a generalization of the term rewriting, allowing free variables in terms and replacing pattern matching by unification in order to reduce these terms.
All evaluation in the prototype s Lucas-Interpreter is done by term rewriting on Isabelle s terms, see [section]3.5 below; in this section some of respective preparations are described.
Among the topics are an evaluation of a pure embedded domain-specific language for strategic term rewriting, design patterns and principles for internal domain-specific languages, a formal semantics of Kermata, languages for spatial computing, and the design and transformation of a domain-specific language for reconfigurable conveyor systems.
It also plays an important role in the definition of some algorithms of unification modulo equational theories that are defined by confluent term rewriting systems.
Although term rewriting can be used for program optimization purposes, there are only few works on it.
It has been studied in the theory of data bases [Fernandez and Minker 1991; Volger 1989a,b], introduced in the theory of algebraic specifications and conditional term rewriting [Goguen 1989; Wolter and Lowe 1992; Kaplan 19871, and utilized for specifications of nondeterminism [Walicki and Meldal 1995c,a; Walicki 19931.
In another class, we spent the term rewriting Greek myths.
The direct sum of two term rewriting systems is the union of systems having disjoint sets of function symbols.
In order to solve this inefficiency, lazy evaluation is usually performed by graph rewriting [Staples 1980] instead of term rewriting. In graph rewriting, the two arguments of g(x,x) point to the same node in the graph, so that in g(t,t) the thunks in t are not duplicated.
Note that, if logical variables do not occur in the goal, the narrowing evaluation is akin to functional languages (term rewriting).
General Terms: Languages Additional Key Words and Phrases: Abstract machine, automata, specificity ordering, term rewriting
Furthermore, equational reasoning (of which term rewriting is a special case) applies equally to closed and open terms.