✳flâneur — a map of the web's best reading
Against Query Based Compilers
matklad.github.io · 1,469 words · saved by 1 readers
Query based compilers are all the rage these days, so it feels only appropriate to chart some treacherous shoals in those waters.
Query based compilers are all the rage these days, so it feels only appropriate to chart some treacherous shoals in those waters. A query-based compiler is a straightforward application of the idea of incremental computations to, you guessed it, compiling. A compiler is just a simple text transformation program, implemented as a lot of functions. You could visualize a run of a compiler on a particular input source code as a graph of function calls: Here, schematically, squares are inputs like file text or compiler’s command line arguments, g is an intermediate function (e.g, type checking), wh
Explore this link on the map →saved by
related reading
- NYSRGnotes.ekzhang.com
- How Compiler Explorer Works in 2025 — Matt Godbolt’s blogxania.org
- Incremental Database Computationsfeldera.com
- Rewriting Bun in Rust | Bun Blogbun.com
- A friendly introduction to machine learning compilers and optimizershuyenchip.com
- Against SQLscattered-thoughts.net
- abseil / Performance Hintsabseil.io
- Google's Fully Homomorphic Encryption Compiler — A Primer || Math ∩ Programmingjeremykun.com
- Compilers - What Every Programmer Should Know About Compiler Optimizations | Microsoft Learnlearn.microsoft.com
- [1912.05036] RVSDG: An Intermediate Representation for Optimizing Compilersarxiv.org
- Speculation in JavaScriptCore | WebKitwebkit.org
- What even is compiler correctness?williamjbowman.com