| Safe Haskell | None |
|---|
TPDB.DP.Graph
- components :: (Ord b, Ord t) => RS (Marked t) (Term b (Marked t)) -> [Either (Rule (Term b (Marked t))) (RS (Marked t) (Term b (Marked t)))]
- edges :: (Ord t, Ord b) => RS (Marked t) (Term b (Marked t)) -> [(Rule (Term b (Marked t)), Rule (Term b (Marked t)))]
- check :: [(Rule (Term Identifier (Marked Identifier)), Rule (Term Identifier (Marked Identifier)))]
- sys :: TRS Identifier Identifier
Documentation
components :: (Ord b, Ord t) => RS (Marked t) (Term b (Marked t)) -> [Either (Rule (Term b (Marked t))) (RS (Marked t) (Term b (Marked t)))]Source
DP problems for strongly connected components, topologically sorted, with CyclicComponents in Right, others in Left.
edges :: (Ord t, Ord b) => RS (Marked t) (Term b (Marked t)) -> [(Rule (Term b (Marked t)), Rule (Term b (Marked t)))]Source
edges of the estimated dependency graph
check :: [(Rule (Term Identifier (Marked Identifier)), Rule (Term Identifier (Marked Identifier)))]Source