| definition: |
eqConsPattern :: Eq f => Term f -> Term f -> Bool eqConsPattern (TermVar _) _ = False eqConsPattern (TermCons _ _) (TermVar _) = False eqConsPattern (TermCons c1 ts1) (TermCons c2 ts2) = c1 == c2 && length ts1 == length ts2 |
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Checks whether the constructor pattern of the first term is equal to the --- constructor pattern of the second term. Returns `True` if both terms have --- the same constructor and the same arity. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{TermVar},_) |-> {False} || (_,{TermCons},{TermVar}) |-> {False} || (_,{TermCons},{TermCons}) |-> _}
|
| name: |
eqConsPattern |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Eq a => Term a -> Term a -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |