20 random bookmarks

2025-07-03

125.

Beamer Viewer

beamerviewer.euxane.eu

This web app displays notes and slides in separate windows,
keeping both synchronised.
It accepts simple, double-width, or double-height PDF presentations:

2025-06-26

123.

Box combinators

mmapped.blog/posts/41-box-combinators.html

In functional programming,
combinator libraries refer to a design style that emphasizes bottom-up program construction.
Such libraries define a few core data types
and provide constructors—functions that create initial objects—and combinators—functions that build larger objects from smaller pieces.

Combinators enable the programmer to use intuitive visual and spatial reasoning
that’s vastly more powerful than linear language processing.
As a result, solving problems with combinators feels like playing with lego pieces.

2025-06-18

121.

You can use `fzf` to review git commits

jvns.ca/til/fzf-preview-git-commits

I just learned that
you can use it to review a git commit like this and I thought that was really
cool.

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-23

111.

share_target - Web application manifest

developer.mozilla.org/en-US/docs/Web/Progressive_web_apps/Manifest/Reference/share_target

The share_target manifest member allows installed Progressive Web Apps (PWAs) to be registered as a share target in the system's share dialog.

2025-04-04

104.

Pitfalls of Safe Rus

corrode.dev/blog/pitfalls-of-safe-rust

When people say Rust is a “safe language”, they often mean memory safety.
And while memory safety is a great start, it’s far from all it takes to build robust applications.
Memory safety is important but not sufficient for overall r…

2025-03-21

103.

Life Altering Postgresql Patterns

mccue.dev/pages/3-11-25-life-altering-postgresql-patterns

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

91.

Advent of Code on the Nintendo DS

sailor.li/aocnds.html

Solving AoC on the DS with Rust.

2024-10-16

83.

Damas-Hindley-Milner inference two ways

bernsteinbear.com/blog/type-inference

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

56.

plainweb

www.plainweb.dev

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

2024-06-24

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.

2024-06-21

49.

On testing Go code using the standard library | Henrique Vicente

henvic.dev/posts/testing-go

Most programming language ecosystems provide assert functions in their testing libraries but not Go's. Go's standard testing package follows a more direct and to-the-point approach.

2024-06-20

48.

build2 | C/C++ Build Toolchain

build2.org

build2 is an open source (MIT), cross-platform build toolchain that aims to approximate Rust Cargo's convenience for developing and packaging C/C++ projects while providing more depth and flexibility, especially in the build system.

47.

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

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

2024-06-19

45.

Avoiding complexity with systemd

mgdm.net/weblog/systemd

Using systemd to avoid having to write some risky code

2024-06-14

30.

litterbox - IRC logger

git.causal.agency/litterbox/about

2024-06-13

21.

Building Go programs with Nix Flakes

xeiaso.net//blog/nix-flakes-go-programs
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.