Tech

Today a cute little program landed in my RSS feed called flower. It promises to be simple to setup, grow infinitely, and it’s templating engine is a thin wrapper around just writing Clojure.

My AoC 2025 solutions in Common Lisp.

I am well aware everything I say is arbitrary and it’s all just for fun.

Some debates online often end up with people not agreeing on what languages are high/low level. In part definitely because of the relative meaning which even the wiki mentions, however even the definition of high-level meaning “with strong abstraction” is definitely not good. It places C++ for example among the high-level languages which certainly it shouldn’t be unless we want ASM/C to be low and everything else be high.

So we need more levels to spread out all the high-level languages, and those levels should probably be based on objective features not on vibes, so we can relay information even if everybody didn’t agree that the scale is correct, at least they’d know how to rank a language.

One of the great features many Lisp languages share is that they try to have an extremely tiny core language and then just implement everything else in it.

Many times I’ve pondered if Haskell could support variadic arguments or at least keywords, since sometimes they are more readable and I for one do prefer them:

This has since become a Lang-Talk.

I’ve been reading through Plucking Constraints being sent there by the effet library because I keep wondering about one subject and I hoped seeing how this library was implemented would enlighten me.

When working with some files for our paper, I needed to extract some input data from an archive, not all as there’s many of them, convert them, and then run it all through some pipelines. There’s different tools such as Nix or Snakemake which allow you to systematically work with isolated pipelines.

A few let’s say statements about system design decisions followed by ponderings. Efficiency is actively sidelined.

I’ve created a repo for the package which implements an MVP of this system, using algorithms from the paper The Simple Essence of Algebraic Subtyping, specifically implementing Simple-Sub.

I try to approach most technology with a healthy dose of scepticism. But I do try to approach it, most technology isn’t worldchanging yet almost none of it is dry of some good ideas.

I did make about a 14€ mistake today, which I want to write down so I can be reminded of it and not spend another Wei on this nonsense. I did set this money aside for experiments and the sort today, but I’d still very much preffered if that didn’t end up being the case.

Today I did an experiment, way back when I played SWTOR they allowed you to play in the starting area before the download was finished, similarly World of Tanks allows one to play with low-tier tanks before the high-tier download etc.

It’s a nice thought to be able to play immediately, games are specifically great for this since much of their data is stored in separate files most of which are unloaded at any given time.

And with modern tools like FUSE, we can simulate this behaviour for arbitrary games.

I had a random thought today while looking for a word in a list, what if those words were ordered by edit distance rather than alphabetically…

Computers are built on top of abstractions, I would perhaps even be willing to say that it is one of the few things in life that are pure abstractions all the way down. And while languages are excellent at that, some parts of the current computer systems are rather more lacking.

If I were to tell you that I want a trivial program, that takes two numbers and adds them, how much work is that gonna be?

So, many of you may be familiar with the ol’ set of numbers that are present in nearly every language:

• Integers
• Floats

But some languages go beyond this, and I mean wayyy beyond.. time to say hi to the numeric tower.

This is a recollection of today’s attempts to solve the write delays on my main home mount.

I went through a few configurations recently trying to get the perfect networking setup.

I gave a bit of my time today, to an attempt at packaging Starship for Guix. After having it on Nix for a while now, since it was a simple to setup prompt, with very sane defaults.

You might be surprised to see both Guix and Nix in the tags today.

That’s because I decided to look into something that’s been sitting in the back of my mind for a few years now.

There’s these two awesome projects, that sadly don’t really want to talk nice with each other. So what if, we made something that could be the middleman.

Today we’ll just be looking at the ideas and possibilities, nothing concrete.

G-Expressions are one of the more difficult edges one needs to understand when learning Guix more into depth, especially because their errors can be slightly cryptic and as it may be, usually the more different explanations the merrier for difficult subjects, since maybe the next one is the one for you that’ll make it click.

This is quite a specific document for quite specific people My UNI teaches a course on Programming Paradigms, which is great and all, however it focuses solely on those, even though it teaches Racket and Prolog as a byproduct. Sadly omitting some crucial general programming concepts in the languages, for Scheme at least that I hope to introduce here.

When you want a list of regular files in a directory in Guile Scheme, you might want to recursively list everything in a tree and check the files in there. And you might see scandir which works nicely, and has an incredibly simple interface, however it doesn’t recurse. Aaand it returns . and .. which you need to throw away and it doesn’t show the entire path, so if you’d want to recurse yourself you need to deal with that as well.

• Ambience

This is written in Guile Scheme It’s quite similar to the Racket version which however has slightly uglier syntax so, meh

And goddamn there’s a lot of stuff I’d need to cover let’s say we’re all schemers who just happen to not know about these things

• Ambience

This is a dumb little experiment based on the paper “Protoypes: Object-Orientation, Functionally” which I happened to be reading just before somebody said that no OOP in possible in C, well we have to see about that won’t we? And yes, this is silly, but I thought I’d share anyways.

Imma start including a song with my posts, just for fun and to share some beauty of the world and have a record

Note the following works with specifically modern ELF binaries which is basically the only thing you’ll ever see anyways though

Okay, so there’s been a surprising number of people that have no idea about this, even some friends that otherwise have quite deep knowledge of linux.

If you want to run a downloaded binary on Guix or Nix, you might sometimes come across this message…

I’ve seen the Linux version of this quote stated so many times, that after quite a while of using both systems, I have to make a few points.

This is a little assortment of places where I’ve found Lisp in the world…

This code is a completely valid C source file:

$($){
  return $
;}

main () {
  printf("%d\n", $(23))
;}

and I don’t even mean that it’s part of a project or whatever, this verbatim compiles in both gcc and clang!!! Go ahead try it, I’ll wait.

This is a reaction to some of the points made in DistroTube’s video on GNU Guix.

I was walking along with a dear friend of mine, debating about the universe and everything. And he mentioned a school project he did, a bencode parser written in Haskell.

Hello everyone, as somebody living in Emacs atop GUIX, browsing with Firefox and letting Sourcehut host my Git and website, I owe immeasurable thanks to all the wonderful people that make all these things possible.

So, this site is made thanks to sr.ht and haunt, I used Org-Mode exported to HTML hosted on GitHub for the longest time…