definition:
|
totalFuncAnalysis :: Analysis Bool
totalFuncAnalysis =
combinedDependencyFuncAnalysis "TotalFunc" totalAnalysis True analyseTotalFunc
|
demand:
|
no demanded arguments
|
deterministic:
|
deterministic operation
|
documentation:
|
--- An operation is totally and functionally defined if it is totally defined
--- and functionally defined (see `Analysis.Deterministic`).
--- Thus, it is defined without any pattern failures in the sense
--- of purely functional programming.
|
failfree:
|
<FAILING>
|
indeterministic:
|
referentially transparent operation
|
infix:
|
no fixity defined
|
iotype:
|
{() |-> {CombinedDependencyFuncAnalysis}}
|
name:
|
totalFuncAnalysis
|
precedence:
|
no precedence defined
|
result-values:
|
{CombinedDependencyFuncAnalysis}
|
signature:
|
Analysis.Types.Analysis Prelude.Bool
|
solution-complete:
|
operation might suspend on free variables
|
terminating:
|
possibly non-terminating
|
totally-defined:
|
possibly non-reducible on same data term
|