Information | |
---|---|
has gloss | eng: In mathematics, computer science and logic, overlap, as a property of the reduction rules in term rewriting system, describes a situation where a number of different reduction rules specify potentially contradictory ways of reducing a reducible expression (or redex) within a term. More precisely, if a number of different reduction rules share function symbols on the left hand side, overlap can occur. Often we do not consider trivial overlap with a redex and itself. |
lexicalization | eng: overlap |
instance of | e/Rewriting |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint