2025-10-24
How to Run 1:1s as an Engineering Manager
justoffbyone.com2025-07-31
A dive into open chat protocols
wiki.alopex.li/ADiveIntoOpenChat2025-05-28
SAT Live!
localhost:40002025-05-15
Writing that changed how I think about PL
bernsteinbear.com/blog/pl-writingEvery so often I come across a paper, blog post, or (occasionally) video that completely changes how I think about a topic in programming languages and compilers. For some of these posts, I can’t even remember how I thought about the idea before reading it—it was that impactful.
2025-01-09
if got, want: A Simple Way to Write Better Go Tests
mtlynch.io/if-got-want-improve-go-tests2025-01-07
Write your own tiny programming system(s)!
d3s.mff.cuni.cz/teaching/nprg0772024-12-17
Advent of Code on the Nintendo DS
sailor.li/aocnds.htmlSolving AoC on the DS with Rust.
2024-09-16
Wayland: i3 to Sway migration
anarc.at/software/desktop/wayland2024-08-18
Permacomputing
permacomputing.netPermacomputing is both a concept and a community of practice oriented around issues of resilience and regenerativity in computer and network technology inspired by permaculture.
2024-08-15
Writing a C Compiler
nostarch.com/writing-c-compilerA fun, hands-on guide to writing your own compiler for a real-world programming language.
2024-07-02
A write-ahead log is not a universal part of durability
notes.eatonphil.com/2024-07-01-a-write-ahead-log-is-not-a-universal-part-of-durability.htmlA write-ahead log is not a universal part of durability
2024-06-28
Advanced Bash-Scripting Guide
tldp.org/LDP/abs/html/index.html2024-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-18
Understanding SPF, DKIM, and DMARC: A Simple Guide
github.com/nicanorflavier/spf-dkim-dmarc-simplified2024-06-14
A useful shell prompt
blog.meain.io/2022/my-shell-promptFeatureful zsh prompt.
2024-06-13
API Tokens: A Tedious Survey
fly.io/blog/api-tokens-a-tedious-surveyComparison between types of API tokens.
An easy-to-implement, arena-friendly hash map
nullprogram.com/blog/2023/09/30Optimal SQLite settings for Django
gcollazo.com/optimal-sqlite-settings-for-djangoThere’s plenty of information out there on how to scale Django to handle numerous requests per second, but most of it…
2024-06-11
gamja: Simple IRC web client
sr.ht/~emersion/gamja2024-06-10
On Dependency Usage in Rust
landaire.net/on-dependency-usage-in-rustRust and Node aren't bad for encouraging dependency use -- your favorite language's tools just suck.