@Laauurraaa the smallest binary footprint dream is actually quite close to #BinaryLambdaCalculus—there are only three (relatively high-level!) primitives that are expressed by short patterns of bits.

And you might've seen me boasting a 350-bit sorting program already, so something taking a whole screen of C code fits into 50 bytes, actually!

Given some (relatively primitive) compiler building, one can have a strictly typed&inferred language that compiles down to raw applicative #LambdaCalculus and actually looks easy on the eye! Something like Scheme & #prescheme, but even more minimalist in the computation basis! And yes, fast too, given a bit of (trivial) optimization and maybe your FPGA ideas 

Thanks @pjotrprins, #prescheme is definitely lacking in documentation and examples right now, and I know that people are eager to dive in. Unfortunately it's not very user-friendly in its current state; the language didn't see much use outside of its initial use-case, and it shows!

After the port is complete, I'll be making a number of language and tooling changes to improve this situation. Once those are settled, I'll move on to documentation and guides to make the language accessible to a wider audience.

An outline of the planned changes can be found here: https://prescheme.org/roadmap.html

@nlnet