Reduction system
From Wikipedia, the free encyclopedia
In mathematics, a reduction system is a system where terms can be re-written by using a finte list of rewriting rules.
Examples of reduction systems include string rewriting systems, term rewriting systems, lambda calculus under lambda conversion, and combinatory reduction systems.
When none of the reduction rules can be applied to a given expression, it is said to be in normal form.
[edit] See also
 |
This logic-related article is a stub. You can help by expanding it. |
