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: Rewriting
Famous quotes containing the words term and/or systems:
“Most literature on the culture of adolescence focuses on peer pressure as a negative force. Warnings about the “wrong crowd” read like tornado alerts in parent manuals. . . . It is a relative term that means different things in different places. In Fort Wayne, for example, the wrong crowd meant hanging out with liberal Democrats. In Connecticut, it meant kids who weren’t planning to get a Ph.D. from Yale.”
—Mary Kay Blakely (20th century)
“The geometry of landscape and situation seems to create its own systems of time, the sense of a dynamic element which is cinematising the events of the canvas, translating a posture or ceremony into dynamic terms. The greatest movie of the 20th century is the Mona Lisa, just as the greatest novel is Gray’s Anatomy.”
—J.G. (James Graham)