CurryInfo: rewriting-3.0.0 / Rewriting.DefinitionalTree.idtPositions

definition:
idtPositions :: TRS _ -> [Pos]
idtPositions []             = []
idtPositions trs@((l, _):_) = case l of
  TermVar _     -> []
  TermCons _ ts -> [[i] | i <- [1 .. length ts], all (isDemandedAt i) trs]
demand:
argument 1
deterministic:
deterministic operation
documentation:
--- Returns a list of all inductive positions in a term rewriting system.
failfree:
<FAILING>
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{({[]}) |-> {[]} || ({:}) |-> _}
name:
idtPositions
precedence:
no precedence defined
result-values:
_
signature:
[(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> [[Prelude.Int]]
solution-complete:
operation might suspend on free variables
terminating:
possibly non-terminating
totally-defined:
possibly non-reducible on same data term