CurryInfo: call-analysis-3.2.0 / Analysis.lessCSpecific
definition: 
|
lessCSpecific :: CTerm -> CTerm -> Bool lessCSpecific CBot _ = True lessCSpecific (CVar _) _ = False lessCSpecific (CCons c1 args1) t2 = case t2 of CCons c2 args2 -> c1==c2 && all (uncurry lessCSpecific) (zip args1 args2) _ -> False |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
is bottom term t1 a generalization (i.e., with less information) than t2? |
|
failfree:
|
(_, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{({CBot},_) |-> {True} || ({CVar},_) |-> {False} || ({CCons},{CCons}) |-> _ || ({CCons},{CBot}) |-> _ || ({CCons},{CVar}) |-> _}
|
|
name:
|
lessCSpecific |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
CTerm -> CTerm -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |