Expand description
Analysis utilities for the reduction graph.
Detects primitive reduction rules that are dominated by composite paths, using asymptotic normalization plus monomial-dominance comparison.
This analysis is sound but incomplete: it reports Dominated only when
the symbolic comparison is trustworthy, and Unknown when metadata is too
weak to compare safely.
Structs§
- Dominated
Rule - A primitive reduction rule proven dominated by a composite path.
- Unknown
Comparison - A candidate comparison that could not be decided soundly.
Enums§
- Comparison
Status - Result of comparing one primitive rule against one composite path.
Functions§
- compare_
overhead - Compare two overheads across all common fields.
- find_
dominated_ rules - Find all primitive reduction rules dominated by composite paths.
- format_
problem_ variant