- data Tree s a where
- transformTree :: Solver s => Mixin (Tree s a -> Tree s a)
- bindTree :: Solver s => Tree s a -> (a -> Tree s b) -> Tree s b
- insertTree :: Solver s => Tree s a -> Tree s () -> Tree s a
- (/\) :: MonadTree tree => tree a -> tree b -> tree b
- true :: MonadTree tree => tree ()
- disj :: MonadTree tree => [tree a] -> tree a
- conj :: MonadTree tree => [tree ()] -> tree ()
- disj2 :: MonadTree tree => [tree a] -> tree a
- prim :: MonadTree tree => TreeSolver tree a -> tree a
- addC :: MonadTree tree => Constraint (TreeSolver tree) -> tree ()
- addT :: MonadTree tree => Constraint (TreeSolver tree) -> tree Bool
- exist :: (MonadTree tree, Term (TreeSolver tree) t) => Int -> ([t] -> tree a) -> tree a
- forall :: (MonadTree tree, Term (TreeSolver tree) t) => [t] -> (t -> tree ()) -> tree ()
- indent :: Int -> String
- showTree :: (Show (Constraint s), Show a, Solver s) => Int -> Tree s a -> s String
- class (Monad m, Solver (TreeSolver m)) => MonadTree m where
- untree :: Solver s => v -> Tree s v -> s v
Documentation
addC :: MonadTree tree => Constraint (TreeSolver tree) -> tree ()Source
addT :: MonadTree tree => Constraint (TreeSolver tree) -> tree BoolSource