CurryInfo: call-analysis-3.2.0 / TRS.containsApply
definition: 
|
containsApply :: Rule -> Bool containsApply (Rule _ _ rhs) = hasApply rhs where hasApply (Var _) = False hasApply (Func ft f args) = (ft==Def && f=="apply") || any hasApply args |
|
demand:
|
argument 1 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
does a rule contains a call to "apply"? |
|
failfree:
|
_ |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{({Rule}) |-> _}
|
|
name:
|
containsApply |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
Rule -> Prelude.Bool |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |