2025-08-29
You no longer need JavaScript
lyra.horse/blog/2025/08/you-dont-need-jsAn overview of what makes modern CSS so awesome.
2025-08-12
missing.css
missing.style2025-05-23
honk
humungus.tedunangst.com/r/honk
Take control of your honks and join the federation.
An ActivityPub server with minimal setup and support costs.
Spend more time using the software and less time operating it.
2025-02-04
Running a Debian Sid on Ubuntu
blogops.mixinet.net/posts/incus2024-12-17
Building GBA Games in Rust
shanesnover.com/2024/02/07/intro-to-rust-on-gba.html2024-11-20
On "Safe" C++
izzys.casa/2024/11/on-safe-cxx2024-10-10
'Do' More With 'Run'
maxgreenwald.me/blog/do-more-with-runI recently wrote about Async Pool, one of my favorite JavaScript / TypeScript helpers, and today I want to share an even simpler yet extremely useful utility
Gnome Files: A detailed UI examination | datagubbe.se
www.datagubbe.se/gnomefiles2024-09-30
On Leaving Apple
typesanitizer.com/blog/leaving-apple.html2024-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-09
Using use in Gleam
erikarow.land/notes/using-use-gleam2024-06-27
plainweb
www.plainweb.devplainweb is a framework using HTMX, SQLite and TypeScript for less complexity and more joy.
2024-06-26
A (more) Modern CSS Reset
piccalil.li/blog/a-more-modern-css-reset2024-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.