20 random bookmarks

2025-09-01

132.

Jujutsu for everyone

jj-for-everyone.github.io

A Jujutsu tutorial that requires no previous experience with Git or other version control systems.

2025-06-26

124.

The plan-execute pattern

mmapped.blog/posts/29-plan-execute.html

I feel uneasy about design patterns.
On the one hand, my university class on design patterns revived my interest in programming.
On the other hand, I find most patterns in the Gang of Four book to be irrelevant to my daily work;
they solve problems that a choice of programming language or paradigm creates.

My litmus test of a good design pattern is its cross-disciplinary applicability.
I’m more likely to accept an idea that pops up in fields beyond software engineering.
And the most convincing patterns are the ones that help me in everyday life.

This article describes a universal pattern that billions of people rely on daily, but software engineers rarely discuss—the plan-execute pattern.

2025-06-13

117.

What I talk about when I talk about IRs

bernsteinbear.com/blog/irs

I 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-06

107.

Debian installation with encrypted BTRFS

chaos.tomaskral.eu/guides/debian-encrypted-btrfs-root

2025-01-21

99.

Algebraic Effects for the Rest of Us

overreacted.io/algebraic-effects-for-the-rest-of-us

2024-10-10

82.

'Do' More With 'Run'

maxgreenwald.me/blog/do-more-with-run

I 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

2024-09-25

78.

in which interactive development saves the day

technomancy.us/189

2024-09-17

75.

Master hexagonal architecture in Rust

www.howtocodeit.com/articles/master-hexagonal-architecture-rust

Everything you need to write flexible, future-proof Rust applications using hexagonal architecture.

2024-08-28

69.

There can't be only one

www.b-list.org/weblog/2024/aug/27/highlander-problem

There's a concept that I've heard called by a lot of different names, but my favorite name for it is …

2024-08-18

68.

Permacomputing

permacomputing.net

Permacomputing 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-09

64.

Store Code Discussions in Git using Git Notes

wouterj.nl/2024/08/git-notes

Code discussions contain relevant information. Isn’t it a shame that we
keep these in the centralized GitHub/GitLab servers, far away from our
decentralized Git code? As soon as we move provider, we’ll lose all old
discussions! And how do you ever find the pull requests back from 5
years ago? Symfony has implemented a lightweight solution to this problem
years ago using a less-known feature of Git: Git Notes.

2024-07-03

59.

Announcing wcurl: a curl wrapper to download files

samueloph.dev/blog/announcing-wcurl-a-curl-wrapper-to-download-files

2024-06-24

52.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming

arxiv.org/abs/1908.05647

Most 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.

51.

Deriving Dependently-Typed OOP from First Principles -- Extended Version with Additional Appendices

arxiv.org/abs/2403.06707

The 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.

50.

Microfeatures I Love in Blogs and Personal Websites

danilafe.com/blog/blog_microfeatures

In this post, I talk about pleasant but seemingly minor features in personal sites

2024-06-17

37.

Sqlc: 2024 check in — brandur.org

brandur.org/fragments/sqlc-2024

2024-06-13

21.

Building Go programs with Nix Flakes

xeiaso.net//blog/nix-flakes-go-programs
19.

A simple, arena-backed, generic dynamic array for C

nullprogram.com/blog/2023/10/05
16.

Avoid Linux locking up in low memory situations using earlyoom

dataswamp.org/~solene/2022-09-28-earlyoom.html

This article presents the program earlyoom to prevent a Linux system to lock up in low memory situations.

2024-06-09

2.

Piku

piku.github.io/index.html

piku, inspired by dokku, allows you do git push deployments to your own servers, no matter how small they are.