2025-07-31
A dive into open chat protocols
wiki.alopex.li/ADiveIntoOpenChat2025-06-20
Cursed Knowledge | Immich
immich.app/cursed-knowledgeThings we wish we didn't know
2025-03-21
Life Altering Postgresql Patterns
mccue.dev/pages/3-11-25-life-altering-postgresql-patterns2025-03-18
CASCII - ASCII Diagram Builder
cascii.appA well-equipped ASCII diagram builders freely available on the internet.
It stresses portability, simplicity, and immediateness.
2024-12-17
Building GBA Games in Rust
shanesnover.com/2024/02/07/intro-to-rust-on-gba.html2024-10-21
init.py files are optional. Here’s why you should still use them
dev.arie.bovenberg.net/blog/still-use-init-py2024-10-10
Gnome Files: A detailed UI examination | datagubbe.se
www.datagubbe.se/gnomefiles2024-10-04
Snappy UI Optimization with useDeferredValue
www.joshwcomeau.com/react/use-deferred-valueuseDeferredValue is one of the most underrated React hooks. It allows us to dramatically improve the performance of our applications in certain contexts. I recently used it to solve a gnarly performance problem on this blog, and in this tutorial, I'll show you how! ⚡
2024-09-30
On Leaving Apple
typesanitizer.com/blog/leaving-apple.html2024-09-25
in which interactive development saves the day
technomancy.us/1892024-09-02
Parsing awk is tricky
www.raygard.net/awkdoc/pages/awk_parsing_is_tricky.htmlA somewhat compact implementation of the awk programming language
2024-06-24
Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming
arxiv.org/abs/1908.05647Most 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.
Deriving Dependently-Typed OOP from First Principles -- Extended Version with Additional Appendices
arxiv.org/abs/2403.06707The 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
On testing Go code using the standard library | Henrique Vicente
henvic.dev/posts/testing-goMost 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-17
Sqlc: 2024 check in — brandur.org
brandur.org/fragments/sqlc-20242024-06-14
CAUSAL.AGENCY(7)
causal.agencyI make mostly IRC software in C. I like OpenBSD but also the GPL. I just want to read books and try to learn to be kinder. When I can I'd like to talk to strangers and experience more magic.
2024-06-13
Category Theory in Context
math.jhu.edu/~eriehl/context.pdfMacaroons Escalated Quickly
fly.io/blog/macaroons-escalated-quicklyAvoid Linux locking up in low memory situations using earlyoom
dataswamp.org/~solene/2022-09-28-earlyoom.htmlThis article presents the program earlyoom to prevent a Linux system to lock up in low memory situations.
2024-06-11
Go evolves in the wrong direction
valyala.medium.com/go-evolves-in-the-wrong-direction-7dfda8a1a620Go programming language is known to be easy to use. Thanks to its well-thought syntax, features and tooling, Go allows writing easy-to-read…
Hard disagree on this one, but still interesting.