2025-09-01
Jujutsu for everyone
jj-for-everyone.github.ioA Jujutsu tutorial that requires no previous experience with Git or other version control systems.
2025-08-21
A Brief Guide to A Few Algebraic Structures
argumatronic.com/posts/2019-06-21-algebra-cheatsheet.htmlI started writing this post because, for whatever reason, I keep forgetting what the difference is between a ring and a group, which is funny to me because I never forget the difference between a semiring and a semigroup – although other people do, because it’s quite easy to forget! So, I wanted a fast reference to the kinds of algebraic structures that I am most often dealing with in one way or another, usually because I’m writing Haskell (which has some reliance on terminology and structure from abstract algebra and category theory) or I’m trying to read a book about category theory and they keep talking about “groups.” Wikipedia, of course, defines all these structures, and that’s fine, but what I need in those times is more of a refresher than an in-depth explanation.
2025-07-03
Beamer Viewer
beamerviewer.euxane.euThis 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
Box combinators
mmapped.blog/posts/41-box-combinators.htmlIn 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-20
Cursed Knowledge | Immich
immich.app/cursed-knowledgeThings we wish we didn't know
2025-05-06
Debian installation with encrypted BTRFS
chaos.tomaskral.eu/guides/debian-encrypted-btrfs-root2025-02-04
Running a Debian Sid on Ubuntu
blogops.mixinet.net/posts/incus2024-10-10
Gnome Files: A detailed UI examination | datagubbe.se
www.datagubbe.se/gnomefiles2024-09-19
Blogging in Djot instead of Markdown
www.jonashietala.se/blog/2024/02/02/blogging_in_djot_instead_of_markdown2024-09-15
Writing an OS in Rust
os.phil-opp.comThis blog series creates a small operating system in the Rust programming language. Each post is a small tutorial and includes all needed code.
2024-09-10
run freebsd in qemu on linux
sethops1.net/post/run-freebsd-in-qemu-on-linux2024-07-05
JavaScript-Free Sidenotes in Hugo
danilafe.com/blog/sidenotes2024-06-24
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.
Microfeatures I Love in Blogs and Personal Websites
danilafe.com/blog/blog_microfeaturesIn this post, I talk about pleasant but seemingly minor features in personal sites
2024-06-14
Nix as a WebAssembly build tool
determinate.systems/posts/nix-wasm2024-06-13
Category Theory for Programmers: The Preface
bartoszmilewski.com/2014/10/28/category-theory-for-programmers-the-prefaceBuilding Go programs with Nix Flakes
xeiaso.net//blog/nix-flakes-go-programs2024-06-11
gamja: Simple IRC web client
sr.ht/~emersion/gamja2024-06-10
On Dependency Usage in Rust
landaire.net/on-dependency-usage-in-rustRust and Node aren't bad for encouraging dependency use -- your favorite language's tools just suck.
2024-06-09
The Hare programming language
harelang.orgHare is a systems programming language designed to be simple, stable, and robust. Hare uses a static type system, manual memory management, and a minimal runtime. It is well-suited to writing operating systems, system tools, compilers, networking software, and other low-level, high performance tasks.