2025-08-25
Everything I know about good API design
www.seangoedecke.com/good-api-design2025-08-12
missing.css
missing.style2025-06-13
What I talk about when I talk about IRs
bernsteinbear.com/blog/irsI have a lot of thoughts about the design of compiler intermediate representations (IRs). In this post I’m going to try and communicate some of those ideas and why I think they are important.
2025-05-28
SAT Live!
localhost:40002025-05-23
Async from scratch 1: What's in a Future, anyway? | natkr's ramblings
natkr.com/2025-04-10-async-from-scratch-1There are a lot of guides about how to use async Rust from a "user's
perspective", but I think it's also worth understanding how it
works, what those async blocks actually mean.
2025-04-24
Instrumenting Axum projects
determinate.systems/posts/instrumenting-axum2024-12-17
GBA From Scratch With Ferris
lokathor.github.io/gba-from-scratchUsing Nix to Try Tools
entropicthoughts.com/using-nix-to-try-tools2024-10-16
Damas-Hindley-Milner inference two ways
bernsteinbear.com/blog/type-inference2024-08-28
There can't be only one
www.b-list.org/weblog/2024/aug/27/highlander-problemThere's a concept that I've heard called by a lot of different names, but my favorite name for it is …
2024-07-15
"GitHub" Is Starting to Feel Like Legacy Software
mistys-internet.website/blog/blog/2024/07/12/github-is-starting-to-feel-like-legacy-softwareI’ve used a lot of tools over the years, which means I’ve seen a lot of tools hit a plateau. That’s not always a problem; sometimes …
2024-06-28
Advanced Bash-Scripting Guide
tldp.org/LDP/abs/html/index.html2024-06-27
plainweb
www.plainweb.devplainweb is a framework using HTMX, SQLite and TypeScript for less complexity and more joy.
2024-06-24
Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming
arxiv.org/abs/1908.05647Most functional languages rely on some garbage collection for automatic memory management. They usually eschew reference counting in favor of a tracing garbage collector, which has less bookkeeping overhead at runtime. On the other hand, having an exact reference count of each value can enable optimizations, such as destructive updates. We explore these optimization opportunities in the context of an eager, purely functional programming language. We propose a new mechanism for efficiently reclaiming memory used by nonshared values, reducing stress on the global memory allocator. We describe an approach for minimizing the number of reference counts updates using borrowed references and a heuristic for automatically inferring borrow annotations. We implemented all these techniques in a new compiler for an eager and purely functional programming language with support for multi-threading. Our preliminary experimental results demonstrate our approach is competitive and often outperforms state-of-the-art compilers.
2024-06-20
Why does SQLite (in production) have such a bad rep?
avi.im/blag/2024/sqlite-bad-rep2024-06-19
Avoiding complexity with systemd
mgdm.net/weblog/systemdUsing systemd to avoid having to write some risky code