Transformation of Applicative Specifications into Imperative ...

APPENDIX C. FORMAL SPECIFICATIONS OF TRANSFORMATIONS
Result:
=======
ValueExpr: the imperative version of the value
expression list
∗/
TRProductExpr :
ValueExpr ∗ × ExpType ∗ × ExpType × FUNC ×
TRANS × TYPES →
ValueExpr
TRProductExpr(vel, etl, et, func, trans, types) ≡
let
(b, vl) = makeLetBinding(len vel, 0, 〈〉, 〈〉),
vel ′ =
makeValueExprList(vel, etl, vl, trans, func)
in
LetExpr(
〈mk_LetDef(
MakeBinding(makeBinding(b)),
ProductExpr(vel))〉,
makeAssignExpr(ProductExpr(vel ′ ), et, trans))
end,
/∗Transforms a set expression.∗/
/∗
Arguments:
=======
se: the set expression
et: the expected type the components of the set
expression
Result:
=======
SetExpr: the imperative version of the set expression
∗/
TRSetExpr :
SetExpr × ExpType × FUNC × TRANS × TYPES →
SetExpr × TYPES
TRSetExpr(se, et, func, trans, types) ≡
case se of
RangedSetExpr(fve, sve) →
let
(fve ′ , types ′ ) =
TRValueExpr(fve, et, func, trans, types),
(sve ′ , types ′′ ) =
TRValueExpr(sve, et, func, trans, types ′ )
200