[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: GNU troff converted to checked integer arithmetic
|
From: |
G. Branden Robinson |
|
Subject: |
Re: GNU troff converted to checked integer arithmetic |
|
Date: |
Fri, 19 Jul 2024 15:15:20 -0500 |
[self-follow-up]
At 2024-07-19T14:47:01-0500, G. Branden Robinson wrote:
> (I wanted to cite a classic CS paper here about integer arithmetic
> setting forth the alternatives of trapping, wrapping, and saturating,
> but while I've read it, I can't find it now. :-/ )
Saying this and sending the mail kicked it loose as I thought it might.
C. A. R. Hoare's "An Axiomatic Basis for Computer Programming"[1]
set these forth as "strict", "firm", and "modulo", respectively.
Regards,
Branden
[1] https://dl.acm.org/doi/pdf/10.1145/363235.363259
signature.asc
Description: PGP signature