20 random bookmarks

2025-07-31

127.

A dive into open chat protocols

wiki.alopex.li/ADiveIntoOpenChat

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-03-13

101.

Building interactive web pages with Guile Hoot

spritely.institute/news/building-interactive-web-pages-with-guile-hoot.html

2024-10-24

85.

Rust Prism

registerspill.thorstenball.com/p/rust-prism

2024-09-25

78.

in which interactive development saves the day

technomancy.us/189

2024-08-15

67.

Writing a C Compiler

nostarch.com/writing-c-compiler

A fun, hands-on guide to writing your own compiler for a real-world programming language.

2024-08-14

65.

A Flexible Minimalist Neovim for 2024

wickstrom.tech/2024-08-12-a-flexible-minimalist-neovim.html

2024-07-15

62.

"GitHub" Is Starting to Feel Like Legacy Software

mistys-internet.website/blog/blog/2024/07/12/github-is-starting-to-feel-like-legacy-software

I’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-07-05

60.

JavaScript-Free Sidenotes in Hugo

danilafe.com/blog/sidenotes

2024-06-26

54.

You probably wrote half a monad by accident

gieseanw.wordpress.com/2024/06/25/you-probably-wrote-half-a-monad-by-accident
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-14

34.

Nix as a WebAssembly build tool

determinate.systems/posts/nix-wasm

2024-06-13

26.

The magic of dependency resolution

ochagavia.nl/blog/the-magic-of-dependency-resolution
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-11

11.

Optimizing Font Files for the Modern Web

documentation.platformos.com/best-practices/performance/optimizing-font-files