CurryInfo: call-analysis-3.2.0 / Analysis.lessSpecificEqCallPattern
definition: 
|
lessSpecificEqCallPattern :: (a->a->Bool) -> SemEq a -> SemEq a -> Bool lessSpecificEqCallPattern lessSpecific (Eq f1 args1 v1) (Eq f2 args2 v2) = f1==f2 && all (uncurry lessSpecific) (zip args1 args2) && lessSpecific v1 v2 |
|
demand:
|
arguments 2 3 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Is semantic equation e1 less specific than e2 w.r.t. some call pattern? The first argument is the information ordering on terms. A semantic equation is less specific iff all arguments and the result of the equations are pairwise less specific. |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{Eq},{Eq}) |-> _}
|
|
name:
|
lessSpecificEqCallPattern |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(a -> a -> Prelude.Bool) -> SemEq a -> SemEq a -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |