Beginning with Tree
occurs :: Eq a -> Tree a -> a -> Bool
Using || instead of or
flatten :: Tree a -> [a]
occursST :: (Eq a, Ord a) -> Tree a -> a -> Bool
type Assoc
data Prop + examples
Subst + eval :: Subst -> Prop -> Bool
vars :: Prop -> [Char] Extract all vars from a Prop
bools :: Int -> [[Bool]]
bbools :: Int -> [[Bool]] compute all possible permutations of True,
False using binary conversion
Tree in their own module.
Some exercise on Tree