CurryInfo: rewriting-3.0.0 / Rewriting.Rules.rVars

definition:
rVars :: Rule _ -> [VarIdx]
rVars (l, _) = tVars l
demand:
argument 1
deterministic:
deterministic operation
documentation:
--- Returns a list without duplicates of all variables in a rule.
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{({(,)}) |-> _}
name:
rVars
precedence:
no precedence defined
result-values:
_
signature:
(Rewriting.Term.Term a) -> [Prelude.Int]
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
reducible on all ground data terms