yeah, I recall. But everywhere, we only have 0 and 1, so it is really
annoying always to fall into the same trap. Couldn't the compiler learn
about 0 and Zero etc.?
Am 05.07.18 um 18:48 schrieb Bill Page:
> Maybe like this:
>
> (1) -> Integer has Zero:()->Integer
>
>(1) true
>
Maybe like this:
(1) -> Integer has Zero:()->Integer
(1) true
Type: Boolean
(2) -> Integer has One:()->Integer
(2) true
Type: Boolean
As I recall 0 is just a
What is the proper way to qualify a type E to have a constant or a
function with no variables?
Other functions work well, here are examples from the algebra code.
if R has imaginary : () -> R then
if SMPF has _*: (NonNegativeInteger, SMPF) -> SMPF
if Coef has "*": (Expon,Coef) -> Coef then