Term Rewriting System
Definition
A formal system consisting of terms built from function symbols and variables together with a set of directed rewrite rules of the form l → r that replace instances of a left-hand pattern l by the corresponding right-hand term r; rewriting proceeds by repeatedly matching and replacing subterms.