A fun read describing an important (and seemingly inherent) difficulty of compiler optimization. E-graphs get around this, but IIRC are significantly slower.

A really interesting discussion of array-oriented compilation architectures. Tries to answer the same sorts of questions I’ve been asking myself about making compilers faster – although I think I come to different conclusions right now.

For me, fills a hole between APL (high-performance CPU/GPU array manipulation) and Rust (strong type checking). Super interesting stuff.

I’ve been looking for a good replacement to SSA form for mid-level and low-level optimisations. This feels like the right direction forward, but I need to try it myself before I’m convinced.

Discussion of super-optimization based on equality graphs and finding equivalent expressions. Contrast with https://egraphs-good.github.io/.