Term Rewriting Systems
| This section requires expansion. |
A term rewriting system (TRS) is a rewriting system where the objects are terms, or expressions with nested sub-expressions. For example, the system shown under Logic above is a term rewriting system. The terms in this system are composed of binary operators and and the unary operator . Also present in the rules are variables, which are part of the rules themselves rather than the term; these each represent any possible term (though a single variable always represents the same term throughout a single rule).
The term structure in such a system is usually presented using a grammar. In contrast to string rewriting systems, whose objects are flat sequences of symbols, the objects of a term rewriting system form a term algebra, which can be visualized as a tree of symbols, the structure of the tree fixed by the signature used to define the terms.
The system given under Logic above is an example of a term rewriting system.
Read more about this topic: Reduction Systems
Famous quotes containing the words term and/or systems:
“No—is a term very frequently employed by the fair, when they mean everything else but a negative. Their yes is always yes; but their no is not always no.”
—Anonymous, U.S. women’s magazine contributor. M, Weekly Visitor or Ladies Miscellany, p. 203 (April 1803)
“The skylines lit up at dead of night, the air- conditioning systems cooling empty hotels in the desert and artificial light in the middle of the day all have something both demented and admirable about them. The mindless luxury of a rich civilization, and yet of a civilization perhaps as scared to see the lights go out as was the hunter in his primitive night.”
—Jean Baudrillard (b. 1929)