Improve type deduction for numeric types

[jbearer]

The polymorphic type of number literals (i.e. 1 :: Num a => a) gets in the way of type inference through the abstraction layer of HSPLType. We should either refactor the AST so that GHC can better infer these types or provide helper functions that handle the most common cases, such as increment and decrement, etc.