CurryInfo: rewriting-3.0.0 / Rewriting.Position.positions

definition:
positions :: Term _ -> [Pos]
positions (TermVar _)     = [eps]
positions (TermCons _ ts) = eps:[i:p | (i, t) <- zip [1..] ts,
                                       p <- positions t]
demand:
argument 1
deterministic:
deterministic operation
documentation:
--- Returns a list of all positions in a term.
failfree:
_
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{({TermVar}) |-> {:} || ({TermCons}) |-> {:}}
name:
positions
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