|
definition:
|
unify :: (Eq f, Show f) => TermEqs f -> Either (UnificationError f) (Subst f)
unify = either Left (Right . eqsToSubst) . unify' []
where
eqsToSubst [] = emptySubst
eqsToSubst (eq@(l, r):eqs) = case l of
TermVar v -> extendSubst (eqsToSubst eqs) v r
TermCons _ _ -> case r of
TermVar v -> extendSubst (eqsToSubst eqs) v l
TermCons _ _ -> error ("unify.eqsToSubst: " ++ show eq)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Unifies a list of term equations. Returns either a unification error or a
--- substitution.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> {.._#lambda508}}
|
|
name:
|
unify
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
(Prelude.Eq a, Prelude.Show a) => [(Rewriting.Term.Term a, Rewriting.Term.Term a)]
-> Prelude.Either (UnificationError a) (Data.Map.Map Prelude.Int (Rewriting.Term.Term a))
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|