|
definition:
|
flatLet :: [((VarIndex, a), AExpr a)] -> AExpr a -> AExpr a
flatLet decls ex = case liftDecls decls of
[] -> ex
ds' -> case ex of
ALet a ds'' e' -> ALet a (ds' ++ ds'') e'
_ -> ALet (annExpr ex) ds' ex
where
liftDecls :: [((VarIndex, a), AExpr a)] -> [((VarIndex, a), AExpr a)]
liftDecls [] = []
liftDecls ((x, d) : ds) = case d of
ALet _ ds1 e -> ds1 ++ (x, e) : liftDecls ds -- type argument of ALet?
_ -> (x, d) : liftDecls ds
|
|
demand:
|
arguments 1 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- @flatLet ds e@ lifts nested let-declarations in ds to the top-level.
--- In addition, if `e` has the form `Let ds' e'`, the bindings `ds'` are
--- also lifted upwards.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> _ || (_,{ALet}) |-> {ALet} || (_,{AVar}) |-> _ || (_,{ALit}) |-> _ || (_,{AComb}) |-> _ || (_,{AFree}) |-> _ || (_,{AOr}) |-> _ || (_,{ACase}) |-> _ || (_,{ATyped}) |-> _}
|
|
name:
|
flatLet
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
[((Prelude.Int, a), FlatCurry.Annotated.Types.AExpr a)]
-> FlatCurry.Annotated.Types.AExpr a -> FlatCurry.Annotated.Types.AExpr a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|