CurryInfo: call-analysis-3.2.0 / LetDropping.replaceLetCall
demand: 
|
argument 4 |
|
deterministic:
|
deterministic operation |
|
failfree:
|
(_, _, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_,{Rule}) |-> {Func}}
|
|
name:
|
replaceLetCall |
|
precedence:
|
no precedence defined |
|
result-values:
|
{Func}
|
|
signature:
|
String -> [TRS.Term] -> Prelude.Int -> TRS.Rule -> TRS.Term |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |