To be extremely clear, there’s nothing novel about this. This approach had been demonstrated in the paper Scalable Automatic Differentiation of Multiple Parallel Paradigms through Compiler Augmentation, by @wsmoses @vchuravy and their collaborators, and has been discussed a few times already here on Discourse. As mentioned in Is there an equivalent to cross-language link time optimization via LLVM? - #18 by vchuravy (you even intervened in that thread), the main challenge is an infrastructural one: you need to make sure you use compatible versions of LLVM to compile every piece of code, to be able to merge all bitcodes.
giordano
2
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Is there an equivalent to cross-language link time optimization via LLVM? | 30 | 539 | March 6, 2026 | |
| How MLIR bridges Julia and other Languages | 0 | 170 | March 16, 2026 | |
| Ccall for LTO libraries with LLVM backend | 0 | 357 | March 29, 2021 | |
| Should Julia use MLIR in the future? | 20 | 4465 | November 27, 2025 | |
| [ANN] RepliBuild.jl - A full C/C++ interop toolkit for tiered FFI generation | 9 | 459 | March 28, 2026 |