CurryInfo: call-analysis-3.2.0 / LetDropping.insertLetInRule
definition: 
|
insertLetInRule :: [Rule] -> Rule -> Rule insertLetInRule rules (Rule f args exp) = Rule f args (insertLetInExp rules exp) |
|
demand:
|
argument 2 |
|
deterministic:
|
deterministic operation |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,{Rule}) |-> {Rule}}
|
|
name:
|
insertLetInRule |
|
precedence:
|
no precedence defined |
|
result-values:
|
{Rule}
|
|
signature:
|
[TRS.Rule] -> TRS.Rule -> TRS.Rule |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |