Depends on what you mean by “numbers”. We’ve had pretty good abstractions for integers for half a century, we don’t use them because ZOMGFAST. Reals are hopeless, of course.
In some cases it would generate slightly more optimal code, but it makes the language more complex and hard to use, I think.
-
-
Depends. If your goal is "make this as efficient as you can, but more importantly make it correct", it's a pretty nice solution. If your goal is "I want extremely precise manual control over the instructions generated", then yeah, it's probably not what you want.
-
The former seems like a correct characterization but the latter seems off-base. My intent is to require write-/compile-time intervention in the form of some condition that feeds into a proof of boundedness when a proof does not emerge in an automatable way.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.