|
definition:
|
simpExpr :: TAExpr -> TAExpr
simpExpr exp = case exp of
AComb ty FuncCall (qf,_) args ->
if qf == pre "?"
then AOr ty (args!!0) (args!!1)
else if qf == pre "ord" || qf == pre "id" -- ops without preconditions
then head args -- note: Char is implemented as Int in SMT
else exp
_ -> exp
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- Simplifies a FlatCurry expression (only at the top-level!)
-- by considering the semantics of some predefined operations.
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
name:
|
simpExpr
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
FlatCurry.Annotated.Types.AExpr FlatCurry.Types.TypeExpr
-> FlatCurry.Annotated.Types.AExpr FlatCurry.Types.TypeExpr
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|