| definition: |
isOrthogonal :: Eq f => TRS f -> Bool isOrthogonal trs = isLeftLinear trs && null (cPairs trs) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Checks whether a term rewriting system is orthogonal. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
isOrthogonal |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => [(Rewriting.Term.Term a, Rewriting.Term.Term a)] -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |