20 random bookmarks

2025-06-20

Reposted 122.

Cursed Knowledge | Immich

immich.app/cursed-knowledge

Things we wish we didn't know

2025-05-23

110.

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-05-15

109.

Speculation in JavaScriptCore

webkit.org/blog/10308/speculation-in-javascriptcore

This post is all about speculative compilation, or just speculation for short, in the context of the JavaScriptCore virtual machine.

2025-04-24

105.

Instrumenting Axum projects

determinate.systems/posts/instrumenting-axum

2024-12-20

94.

Visitor Pattern Considered Pointless - Use Pattern Switches Instead

nipafx.dev/java-visitor-pattern-pointless

In modern Java, the visitor pattern is no longer needed. Using sealed types and switches with pattern matching achieves the same goals with less code and less complexity.

2024-12-17

93.

GBA From Scratch With Ferris

lokathor.github.io/gba-from-scratch
92.

Building GBA Games in Rust

shanesnover.com/2024/02/07/intro-to-rust-on-gba.html

2024-09-30

79.

On Leaving Apple

typesanitizer.com/blog/leaving-apple.html

2024-09-02

70.

Parsing awk is tricky

www.raygard.net/awkdoc/pages/awk_parsing_is_tricky.html

A somewhat compact implementation of the awk programming language

2024-06-26

53.

A reckless introduction to Hindley-Milner type inference

reasonableapproximation.net/2019/05/05/hindley-milner.html

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.

2024-06-20

46.

Why does SQLite (in production) have such a bad rep?

avi.im/blag/2024/sqlite-bad-rep

2024-06-19

42.

Pimalaya

pimalaya.org

Official website of the Pimalaya project.

2024-06-18

40.

Understanding SPF, DKIM, and DMARC: A Simple Guide

github.com/nicanorflavier/spf-dkim-dmarc-simplified

2024-06-14

33.

A useful shell prompt

blog.meain.io/2022/my-shell-prompt

Featureful zsh prompt.

30.

litterbox - IRC logger

git.causal.agency/litterbox/about

2024-06-13

23.

Macaroons Escalated Quickly

fly.io/blog/macaroons-escalated-quickly
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

2024-06-09

1.

The Hare programming language

harelang.org

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