sop-satisfier-0.3.4.5: Check satisfiability of expressions on natural numbers
Safe HaskellSafe-Inferred
LanguageHaskell2010

SoPSat.Internal.Unify

Documentation

data Unifier f c Source #

Constructors

Subst 

Fields

Instances

Instances details
(Show f, Show c) => Show (Unifier f c) Source # 
Instance details

Defined in SoPSat.Internal.Unify

Methods

showsPrec :: Int -> Unifier f c -> ShowS #

show :: Unifier f c -> String #

showList :: [Unifier f c] -> ShowS #

(Eq c, Eq f) => Eq (Unifier f c) Source # 
Instance details

Defined in SoPSat.Internal.Unify

Methods

(==) :: Unifier f c -> Unifier f c -> Bool #

(/=) :: Unifier f c -> Unifier f c -> Bool #

substsSoP :: (Ord f, Ord c) => [Unifier f c] -> SoP f c -> SoP f c Source #

substSoP :: (Ord f, Ord c) => Atom f c -> SoP f c -> SoP f c -> SoP f c Source #

substProduct :: (Ord f, Ord c) => Atom f c -> SoP f c -> Product f c -> SoP f c Source #

substSymbol :: (Ord f, Ord c) => Atom f c -> SoP f c -> Symbol f c -> SoP f c Source #

substsSubst :: (Ord f, Ord c) => [Unifier f c] -> [Unifier f c] -> [Unifier f c] Source #

unifiers :: (Ord f, Ord c) => SoP f c -> SoP f c -> [Unifier f c] Source #

unifiers' :: (Ord f, Ord c) => SoP f c -> SoP f c -> [Unifier f c] Source #

splitSoP :: (Ord f, Ord c) => SoP f c -> SoP f c -> (SoP f c, SoP f c) Source #

collectBases :: Product f c -> Maybe ([SoP f c], [Product f c]) Source #