He argues that 1 < i … is bad because it doesn't really work if your lower bound is 0 (because then you'd write -1 < …). Funny thing is, in most programming lan

He argues that 1 < i … is bad because it doesn't really work if your lower bound is 0 (because then you'd write -1 < …). Funny thing is, in most programming languages, there is a biggest natural number, too. For example, in Rust, you have a problem, if you want to enumerate all possible byte values: for i in 0u8..256 { } // <-- doesn't compile, because 265 is not a valid value for a u8