RACE: Semantic-linker approach to stable cross-crate ABI without runtime overhead

Sorry, but this is very high-level and sounds like "just implement the hard parts", without even touching on specifics. The problem is well known. The benefits of solving it are well known. Solutions to this have already been explored in way more depth than this post provides. Handwaving "Polymorphic machine code" is not advancing the solution. It's like "let's built it out of Unobtanium". The whole difficulty is in how do you actually make it in a way that has useful performance, robust interface, and how do you either plug rustc or other compiler at install or load time, or integrate with existing linkers/loaders in a way that avoids need to have a compiler at load time. We have rlibs with MIR (requiring rustc at link time). There are solutions like Witness Tables in Swift (but with very high overhead unsuitable for many of Rust's design patterns). AFAIK there has been an experiment to implement automatic polymorphisation in rustc, and it didn't go anywhere, so even if the solution was "let's copy what Swift has proven to work", an implementation of something like it has already proven too difficult. Who's going to actually implement it? dvrkxed: > Instead, the final linker resolves and patches them as computed constants Which linker? How do you make that work across platforms that Rust supports? How is that different from linking rlib?