2025-09-01
Jujutsu for everyone
jj-for-everyone.github.ioA Jujutsu tutorial that requires no previous experience with Git or other version control systems.
2025-06-18
You can use `fzf` to review git commits
jvns.ca/til/fzf-preview-git-commitsI just learned that
you can use it to review a git commit like this and I thought that was really
cool.
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.
2024-11-20
On "Safe" C++
izzys.casa/2024/11/on-safe-cxx2024-10-21
init.py files are optional. Here’s why you should still use them
dev.arie.bovenberg.net/blog/still-use-init-py2024-09-18
Typescript is surprisingly ok for compilers
matklad.github.io/2023/08/17/typescript-is-surprisingly-ok-for-compilers.html2024-09-17
Master hexagonal architecture in Rust
www.howtocodeit.com/articles/master-hexagonal-architecture-rustEverything you need to write flexible, future-proof Rust applications using hexagonal architecture.
2024-09-02
Parsing awk is tricky
www.raygard.net/awkdoc/pages/awk_parsing_is_tricky.htmlA somewhat compact implementation of the awk programming language
2024-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-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-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-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.
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-13
Solving SAT via Positive Supercompilation
hirrolot.github.io/posts/sat-supercompilation.htmlMy personal C coding style as of late 2023
nullprogram.com/blog/2023/10/08An easy-to-implement, arena-friendly hash map
nullprogram.com/blog/2023/09/30OpenBSD extreme privacy setup
dataswamp.org/~solene/2024-06-08-openbsd-privacy-setup.htmlIn this article, you will learn how to install and configure OpenBSD to reduce its network activity over clearnet
Optimal 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-09
The Hare programming language
harelang.orgHare is a systems programming language designed to be simple, stable, and robust. Hare uses a static type system, manual memory management, and a minimal runtime. It is well-suited to writing operating systems, system tools, compilers, networking software, and other low-level, high performance tasks.