In a sense, Robbert's thesis can be viewed as a more mathematically stringent (and thus arguably clearer) C11 specification. For instance, page 42 has the follo

In a sense, Robbert's thesis can be viewed as a more mathematically stringent (and thus arguably clearer) C11 specification. For instance, page 42 has the following mathematical gem: > The C11 standard defines the usual arithmetic conversions as a binary operation on integer types. This definition is complicated and contains some implicit duplication due to symmetry, which is inconvenient when proving properties. To improve the situation, we show that the usual arithmetic conversion of integer types τ_i and σ_i is a least upper bound τ_i ∪ σ_i in a join semi-lattice.