|
definition:
|
unrec :: TAFuncDecl -> TAFuncDecl
unrec decl@(AFunc qn arity vis ty rule) = decl'
where
decl' = AFunc qn arity vis ty (unrecRule rule)
unrecRule (AExternal _ _) = rule
unrecRule (ARule typ argVars expr) = ARule typ argVars
(simplifyExpr (unrecExpr decl DM.empty expr))
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Remove redundant recursion from a function declaration (experimental)
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({AFunc}) |-> {AFunc}}
|
|
name:
|
unrec
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{AFunc}
|
|
signature:
|
FlatCurry.Annotated.Types.AFuncDecl FlatCurry.Types.TypeExpr
-> FlatCurry.Annotated.Types.AFuncDecl FlatCurry.Types.TypeExpr
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|