🚀 go-pugleaf

In article <40rfuk$4k3@newsbf02.news.aol.com>, ffarance@aol.com (FFarance) writes
+ ....
+ As I read them, the implementors could deal with extending some of
+ the simpler operations (add, subtract, negate, shift, and, or, not,
+ etc.) by simple extensions to the code generator (e.g., add the low
+ order part, increment the high order part if the carry bit was set,
+ add the high order part).  
You understnad that this is not reallie enough?  The operation needed
is add-with-carrie, for separatlie handling adding and carrie leavs
twain points in the code where there can be carrie or overflow,
although for anie one sum it can happen on onlie one of them.  The
PDP-11 had it wrong, and the Intel chips and the VAX hav it right.
I for a long while hav believd that there has been too little talk
between processor-bilders and compiler- bilders in the matter of long
arithmetic.  Maibe Charles Moore s experiens is helpful--he needed long
arithmetic in most of his work, and therefore Forth has it.

+ ....