| definition: |
isConsBased :: Eq f => TRS f -> Bool isConsBased trs = all ((isPattern trs) . fst) trs |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Checks whether a term rewriting system is constructor-based. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
isConsBased |
| 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: |
reducible on all ground data terms |