2025-10-17
Automerge
automerge.orgAutomerge is a local-first sync engine for multiplayer apps that works offline, prevents conflicts, and runs fast.
2025-07-31
A dive into open chat protocols
wiki.alopex.li/ADiveIntoOpenChat2025-07-03
A Higgs-bugson in the Linux Kernel
blog.janestreet.com/a-higgs-bugson-in-the-linux-kernelWe recently ran across a strange higgs-bugson that manifested itself in a critical system that stores and distributes the firm’s trading activity data, called Gord. (A higgs-bugson is a bug that is reported in practice but difficult to reproduce, named for the Higgs boson, a particle which was theorized in the 1960s but only found in 2013.) In this post I’ll walk you through the process I took to debug it. I tried to write down relevant details as they came up, so see if you can guess what the bug is while reading along.
Beamer Viewer
beamerviewer.euxane.euThis web app displays notes and slides in separate windows,
keeping both synchronised.
It accepts simple, double-width, or double-height PDF presentations:
2025-06-18
zb beta released
www.zombiezen.com/blog/2025/06/zb-beta-releasezb is a tool for reproducibly building software, similar to Bazel.
(See the comparison page if you’re curious to know the differences.)
When a software build process is reproducible,
it will produce the exact same output
when given the same inputs.
Reproducibility is a desirable property for a software build process to have:
it simplifies debugging,
it enables build speed-ups,
and it is essential for digital supply chain security.
However, reproducibility is a difficult goal to achieve.
2025-01-07
Write your own tiny programming system(s)!
d3s.mff.cuni.cz/teaching/nprg0772024-09-16
Technical Writing One introduction
developers.google.com/tech-writing/one2024-09-15
Writing an OS in Rust
os.phil-opp.comThis blog series creates a small operating system in the Rust programming language. Each post is a small tutorial and includes all needed code.
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-09
Using use in Gleam
erikarow.land/notes/using-use-gleam2024-07-05
JavaScript-Free Sidenotes in Hugo
danilafe.com/blog/sidenotes2024-07-03
Announcing wcurl: a curl wrapper to download files
samueloph.dev/blog/announcing-wcurl-a-curl-wrapper-to-download-files2024-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-24
Deriving Dependently-Typed OOP from First Principles -- Extended Version with Additional Appendices
arxiv.org/abs/2403.06707The expression problem describes how most types can easily be extended with new ways to produce the type or new ways to consume the type, but not both. When abstract syntax trees are defined as an algebraic data type, for example, they can easily be extended with new consumers, such as print or eval, but adding a new constructor requires the modification of all existing pattern matches. The expression problem is one way to elucidate the difference between functional or data-oriented programs (easily extendable by new consumers) and object-oriented programs (easily extendable by new producers). This difference between programs which are extensible by new producers or new consumers also exists for dependently typed programming, but with one core difference: Dependently-typed programming almost exclusively follows the functional programming model and not the object-oriented model, which leaves an interesting space in the programming language landscape unexplored. In this paper, we explore the field of dependently-typed object-oriented programming by deriving it from first principles using the principle of duality. That is, we do not extend an existing object-oriented formalism with dependent types in an ad-hoc fashion, but instead start from a familiar data-oriented language and derive its dual fragment by the systematic use of defunctionalization and refunctionalization. Our central contribution is a dependently typed calculus which contains two dual language fragments. We provide type- and semantics-preserving transformations between these two language fragments: defunctionalization and refunctionalization. We have implemented this language and these transformations and use this implementation to explain the various ways in which constructions in dependently typed programming can be explained as special instances of the phenomenon of duality.
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
2024-06-14
CAUSAL.AGENCY(7)
causal.agencyI make mostly IRC software in C. I like OpenBSD but also the GPL. I just want to read books and try to learn to be kinder. When I can I'd like to talk to strangers and experience more magic.