Documentation

data EdgeLabel

newtype Node

data Edge

mkNode :: Int -> Node

mkEdge :: Node -> [Node] -> EdgeLabel -> Edge

mkVariable :: Node -> Variable -> Edge

mkFun :: Node -> [Node] -> Symbol -> Edge

attached :: Edge -> [Node]

isVariable :: TermGraph -> Node -> Bool

isFun :: TermGraph -> Node -> Bool

isDangling :: TermGraph -> Node -> Bool

data TermGraph

nodes :: TermGraph -> Set Node

data St a

freshNode :: State (St a) Node

fromTermM :: Term -> State (St (Map Variable Node)) TermGraph

fromTerm :: Term -> TermGraph

edge :: Node -> TermGraph -> Maybe Edge

toTerm :: TermGraph -> Term

garbageCollect :: TermGraph -> TermGraph

type Position = [Int]

rootPosition :: Position

fromList :: [Int] -> Position

conc :: Position -> Position -> Position

prepend :: Int -> Position -> Position

directSubgraphs :: TermGraph -> [TermGraph]

subgraphAt :: TermGraph -> Node -> Maybe TermGraph

rootedEdge :: TermGraph -> Edge

children :: TermGraph -> Node -> Maybe (Set Node)

data TermGraphRule

newtype TGS

type Match = Map Variable Node

fromTrs :: Trs -> TGS

match :: TermGraph -> (TermGraph, Node) -> Maybe Match

matches :: TermGraph -> (TermGraph, Node) -> Bool

isRedex :: TGS -> TermGraph -> Bool

type Strategy = TermGraph -> Maybe Node

innermost :: TGS -> Strategy

freshId :: TermGraph -> Int

replace :: (TermGraph, Match) -> (TermGraph, Node) -> TermGraph

step :: TGS -> Strategy -> TermGraph -> Maybe TermGraph

termEq :: TermGraph -> Node -> Node -> Bool

rename :: TermGraph -> Node -> Node -> TermGraph

nfNormalize :: TGS -> TermGraph -> TermGraph

innermostRewriteStep :: TGS -> TermGraph -> Maybe TermGraph