|
definition:
|
isLet :: AExpr _ -> Bool
isLet e = case e of
ALet _ _ _ -> True
_ -> False
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- is expression a let expression?
|
|
failfree:
|
_
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({ALet}) |-> {True} || ({AVar}) |-> _ || ({ALit}) |-> _ || ({AComb}) |-> _ || ({AFree}) |-> _ || ({AOr}) |-> _ || ({ACase}) |-> _ || ({ATyped}) |-> _}
|
|
name:
|
isLet
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{False,True}
|
|
signature:
|
FlatCurry.Annotated.Types.AExpr a -> Prelude.Bool
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|