There are a few primops that report arithmetic overflow, which work on Ints and a couple or so for Words. But that's not enough! Let's add more and clean up the existing code (e.g., make overflow-reporting helpers proper primops) on the go. See the wiki page for the proposal.
Edited
To upload designs, you'll need to enable LFS and have an admin enable hashed storage. More information
Child items
0
Show closed items
No child items are currently assigned. Use child items to break down this issue into smaller parts.
Could you clarify (on the wiki) what assembly you get if you just implement this in Haskell (on top of the "unsafe" primops) and what assembly you'd like to see. Elsewhere (e.g. with the shift primops) we have been able to implement "safe" primops on top of the unsafe ones.
Could you clarify (on the wiki) what assembly you get if you just implement this in Haskell (on top of the "unsafe" primops) and what assembly you'd like to see. Elsewhere (e.g. with the shift primops) we have been able to implement "safe" primops on top of the unsafe ones.