(redirected from Term rewriting)
Also found in: Thesaurus, Legal.
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.
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
References in periodicals archive ?
All evaluation in the prototype s Lucas-Interpreter is done by term rewriting on Isabelle s terms, see [section]3.
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.
In another class, we spent the term rewriting Greek myths.
These terms can also be obtained from the original term by term rewriting with respect to the same TRS; see Barendregt et al.
In Proceedings of Conditional Term Rewriting Systems, CTRS'94.
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.