= Rewriting systems
{wiki=Category:Rewriting_systems}
Rewriting systems are a formal computational framework used for defining computations in terms of transformations of symbols or strings. They consist of a set of rules that describe how expressions can be transformed or "rewritten" into other expressions. These systems are foundational in various areas of computer science and mathematical logic, particularly in the fields of term rewriting, functional programming, and automated theorem proving.
Back to article page
