| definition: |
rCons :: Eq f => Rule f -> [f] rCons (l, r) = union (tCons l) (tCons r) |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Returns a list without duplicates of all constructors in a rule. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{(,)}) |-> _}
|
| name: |
rCons |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => (Rewriting.Term.Term a, Rewriting.Term.Term a) -> [a] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |