I don't know. The complexity of this issue (both implementations and the mental overhead of programmers) just to save a few keystrokes makes me feel it's not really worthwhile? It feels more like a fashion when the convinience is debatable?
I don't know. The complexity of this issue (both implementations and the mental overhead of programmers) just to save a few keystrokes makes me feel it's not really worthwhile? It feels more like a fashion when the convinience is debatable?
After much procrastination finally had the energy to finalize the first draft of Oni's Language Reference document.
https://git.sr.ht/~badd10de/oni-lang/tree/main/item/docs/language_ref.md
Expect it to change as the language evolves but should serve as a good overview of what's possible, in addition to the `README` for more direct usage examples.
I finally wrote out the last sections of the blog post I've been working on for what feels like months now!
https://wakelift.de/2026/03/09/making-your-jitted-code-known-let-me-count-the-ways/
This is a post only tangentially about #rakulang, more about #pldev, in particular a brief look at Stack Unwinding in general, followed by descriptions of the RtlAddFunctionTable function in the WinAPI, #libunwind's pendant, the "perf map" and "JITDUMP" formats that came from linux's perf utility, and the jit reader functionality in #gdb. There's a short mention of #valgrind at the end as well for good measure.
Thanks also to @tekknolagi who has a blog with related topics (and who already covered the perf map among other things that are also in my post)

AOT Compilers It has been normal and expected for a long long time that any machine code they spit out would come with a bunch of metadata that is meant to be used by different pieces of the target system. There is of course symbol names for functions, which allow
Oh, I was wondering what that "abstract" means for a long time
Abstract syntax trees - interior nodes represent programming constructs
Concrete syntax trees - the interior nodes represent nonterminals
(Many nonterminals of a grammar represent programming constructs, but others are "helpers" of one sort of another, such as those representing terms, factors, or other variations of expressions.)