|
definition:
|
unifiable :: (Eq f, Show f) => TermEqs f -> Bool
unifiable = isRight . unify
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Checks whether a list of term equations can be unified.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> {.._#lambda508}}
|
|
name:
|
unifiable
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
(Prelude.Eq a, Prelude.Show a) => [(Rewriting.Term.Term a, Rewriting.Term.Term a)]
-> Prelude.Bool
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|