mkIntMod

Create an Int mod expression.

The result value is a number r such that lhs = r + (rhs * (div lhs)) where div is an Int division that works according to the mkArithDiv rules. The result value is always positive or zero.

For example: 47 mod 13 = 8 47 mod -13 = 8 -47 mod 13 = 5 -47 mod -13 = 5