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