CurryInfo: rewriting-3.0.0 / Rewriting.Term.showTermEq

definition:
showTermEq :: (f -> String) -> TermEq f -> String
showTermEq s (l, r) = showTerm s l ++ " = " ++ showTerm s r
demand:
argument 2
deterministic:
deterministic operation
documentation:
--- Transforms a term equation into a string representation.
failfree:
<FAILING>
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,{(,)}) |-> _}
name:
showTermEq
precedence:
no precedence defined
result-values:
_
signature:
(a -> String) -> (Term a, Term a) -> String
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term