CurryInfo: call-analysis-3.2.0 / LetDropping.letDropping

definition:
letDropping :: [Rule] -> [Rule]
letDropping rules = filter (not . letRule) (map (insertLetInRule rules) rules)
 where
  -- does the rule defines an auxiliary let operation?
  letRule (Rule f _ _) = take 4 (snd (break (=='#') f)) == "#LET"
demand:
argument 1
deterministic:
deterministic operation
failfree:
<FAILING>
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_) |-> {:,[]}}
name:
letDropping
precedence:
no precedence defined
result-values:
{:,[]}
signature:
[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