Term Rewriting

← Back to Domain-Specific Abstractions by Domain

2 domain-specific abstractions whose origin domain is Term Rewriting.

• Overlap (term rewriting) — A term-rewriting configuration in which left-hand sides of rules match intersecting positions in one term, creating competing reductions and a critical-pair confluence obligation.
• Path ordering (term rewriting) — A well-founded term ordering based on root-symbol precedence and recursive comparison of subterms.