Question: (code in HASKELL). Hi. I want to define an abstract syntax with two binary operations: remainder (rem) and an integer division (div) operation. For instance,
(code in HASKELL). Hi. I want to define an abstract syntax with two binary operations: remainder (rem) and an integer division (div) operation. For instance, for ADD and SUB operations you have these definitions:
bop Add (VInt a) (VInt b) = VInt $ a + b bop Sub (VInt a) (VInt b) = VInt $ a b
For computing "q = x div y" and "r = x mod y", we'll have
bop Rem ? bop Div ?
Can you please complete these definitions?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
