| definition: |
redexes :: Eq f => TRS f -> Term f -> [Pos]
redexes trs t =
let trs' = maybe trs (\v -> renameTRSVars (v + 1) trs) (maxVarInTerm t)
in nub [p | p <- positions t, let tp = t |> p,
(l, _) <- trs',
Right sub <- [unify [(l, tp)]],
tp == applySubst sub l]
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns the redex positions of a term according to the given term --- rewriting system. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> {:,[]}}
|
| name: |
redexes |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
Prelude.Eq a => [(Rewriting.Term.Term a, 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 |