2025-09-29
stupid jj tricks
andre.arko.net/2025/09/28/stupid-jj-tricksWelcome to “stupid jj tricks”. Today, I’ll be taking you on a tour through many different jj configurations that I have collected while scouring the internet. Some of what I’ll show is original research or construction created by me personally, but a lot of these things are sourced from blog post, gists, GitHub issues, Reddit posts, Discord messages, and more.
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.
2025-01-21
Algebraic Effects for the Rest of Us
overreacted.io/algebraic-effects-for-the-rest-of-us2025-01-07
Write your own tiny programming system(s)!
d3s.mff.cuni.cz/teaching/nprg0772024-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-08-28
There can't be only one
www.b-list.org/weblog/2024/aug/27/highlander-problemThere's a concept that I've heard called by a lot of different names, but my favorite name for it is …
2024-07-05
JavaScript-Free Sidenotes in Hugo
danilafe.com/blog/sidenotes2024-06-26
You probably wrote half a monad by accident
gieseanw.wordpress.com/2024/06/25/you-probably-wrote-half-a-monad-by-accidentA reckless introduction to Hindley-Milner type inference
reasonableapproximation.net/2019/05/05/hindley-milner.html2024-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-18
Comparing Objective Caml and Standard ML
adam.chlipala.net/mlcomp2024-06-14
Putting Go's Context package into context
blog.meain.io/2024/golang-contextinterstar/cardigan-bay: A new wiki engine in Clojure ...
github.com/interstar/cardigan-bayA single-user “wiki” engine powering the ThoughtStorms wiki.
2024-06-13
API Tokens: A Tedious Survey
fly.io/blog/api-tokens-a-tedious-surveyComparison between types of API tokens.