20 random bookmarks

2025-08-29

131.

You no longer need JavaScript

lyra.horse/blog/2025/08/you-dont-need-js

An overview of what makes modern CSS so awesome.

2025-08-12

128.

missing.css

missing.style

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-02-04

100.

Running a Debian Sid on Ubuntu

blogops.mixinet.net/posts/incus

2024-12-17

92.

Building GBA Games in Rust

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

2024-11-20

88.

On "Safe" C++

izzys.casa/2024/11/on-safe-cxx

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

81.

Gnome Files: A detailed UI examination | datagubbe.se

www.datagubbe.se/gnomefiles

2024-09-30

79.

On Leaving Apple

typesanitizer.com/blog/leaving-apple.html

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

61.

Using use in Gleam

erikarow.land/notes/using-use-gleam

2024-06-27

56.

plainweb

www.plainweb.dev

plainweb is a framework using HTMX, SQLite and TypeScript for less complexity and more joy.

2024-06-26

55.

A (more) Modern CSS Reset

piccalil.li/blog/a-more-modern-css-reset

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

47.

Go's 'range over function' iterators and avoiding iteration errors

utcc.utoronto.ca/~cks/space/blog/programming/GoIteratorsAndAvoidingMistakes

2024-06-18

39.

Understanding a Python closure oddity

utcc.utoronto.ca/~cks/space/blog/python/UnderstandingClosureOddity

2024-06-17

37.

Sqlc: 2024 check in — brandur.org

brandur.org/fragments/sqlc-2024

2024-06-13

26.

The magic of dependency resolution

ochagavia.nl/blog/the-magic-of-dependency-resolution
25.

Solving SAT via Positive Supercompilation

hirrolot.github.io/posts/sat-supercompilation.html
23.

Macaroons Escalated Quickly

fly.io/blog/macaroons-escalated-quickly