So what we're talking about is Pareto efficiency, but we each have slightly different contours for our value functions, which means that our frontiers/level sets are different (just to be clear, I'm agreeing with & paraphrasing what @withoutboats has noted).
Unfortunately, there is no solution to the problem; by definition, all points along a given Pareto frontier have equal value. That said, there are things that we can do to make it possible to advance all of our goals at the same time, in spite of the fact that our frontiers are different.
First, we need to fully define rust so that its meaning is mathematically unambiguous. This will give us a firm foundation for anything else we decide to do. One of the things that holds C/C++ back is that the compiler has to be conservative in deciding what can or can't be done, which means that the performance is not as good as it could be. In my opinion, rust should be specified well enough that it is at least theoretically possible to do formal proofs across what it does; the work that @RalfJung et. al. have (and are) doing in RustBelt should be more heavily invested in.
Once the formal underpinnings are in place, we can check programs, and decide if certain things are true at certain points in the program, which allows further performance gains. This helps address @matklad's performance concern. As an example, consider the lowly floating point number. As far as I know, the rust compiler today cannot do proofs over floating point numbers, so if I have code like the following (not tested, may have errors):
let foo = vec![23.0f32, 45.0, -89.0];
if foo.iter().all(|x| x != 0.0)){
let bar: Vec<f32> = foo.iter().for_each(|x| 1.0f32 / x).collect();
}
it can't do something 'smart' with the division. In tiny code like this, it doesn't matter, but if there are repeated calculations, it would be nice if the compiler had the option of doing something smarter (which can only be done if it can prove that the smart thing to do is correct).
However, the formal underpinnings also help with maintainability by reducing the false positives that clippy and rustc can produce. For example, a hypothetical 'divide by zero' lint that could perform logic over floating point numbers could safely ignore the division by x
above, but could flag it if there was a path to the code that didn't protect against division by 0. That lets a programmer focus in on the real issues, rather than wade through large piles of cruft.