(redirected from Term rewriting system)
Also found in: Thesaurus, Acronyms, Encyclopedia.


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 ?
In the rest of this paper, we assume that R is a constructor-based term rewriting system. Substitutions are an essential concept to define the notions of rewriting and narrowing.
A term rewriting system R is orthogonal if for each rule l [right arrow] r [element of] R the left-hand side l is linear (left-linearity) and for each nonvariable subterm l[|.sub.p] of l there exists no rule l' [right arrow] r' [element of] R such that l[|.sub.p] and l' unify (nonoverlapping) (where l' [right arrow] r' is not a variant of l [right arrow] r in case of p = [Lambda]).
Consequently, the defined functions of an inductively sequential term rewriting system are completely defined over their application domains [Guttag and Horning 1978; Thiel 1984] (i.e., any ground term has a constructor term as a normal form) if the considered term rewriting system is terminating and the possible definitional trees do not contain exempt nodes.