| definition: |
cPairs :: Eq f => TRS f -> [CPair f]
cPairs trs =
let trs' = maybe trs (\v -> renameTRSVars (v + 1) trs) (maxVarInTRS trs)
in nub [(applySubst sub r1,
replaceTerm (applySubst sub l1) p (applySubst sub r2)) |
rule1@(l1, r1) <- trs',
p <- positions l1,
let l1p = l1 |> p, isConsTerm l1p,
rule2@(l2, r2) <- trs,
Right sub <- [unify [(l1p, l2)]],
p /= eps || not (rule1 `isVariantOf` rule2)]
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns the critical pairs of a term rewriting system. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> {:,[]}}
|
| name: |
cPairs |
| precedence: |
no precedence defined |
| result-values: |
{:,[]}
|
| signature: |
Prelude.Eq a => [(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> [(Rewriting.Term.Term a, Rewriting.Term.Term a)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |