Extraordinary Ordinals: Making Compilers Count to Infinity (and Beyond)
Yet another way to make the compiler do the heavy lifting — this time with ordinals that look more like a D&D spell than actual code.
When the average developer hears "ordinal," they think of something from advanced math they've successfully forgotten after college. But Marvin Borner decided it's a perfect excuse to write a compiler that understands transfinite numbers. Spoiler: now your code can recurse deeper than your JIRA board.
What's the deal?
Extraordinary Ordinals is an experimental compiler that operates on ordinal numbers (those that come after infinity). While regular languages stop at int or BigInt, here you can declare a variable of type ω (omega) and casually add ω+1 to it. Sounds like magic? Actually, it's just another way to defer runtime errors to compile time.
Why should you care?
Developers who've written theorem provers or worked with dependent types will appreciate this: ordinals allow formal verification of programs with infinite loops. Want to prove that your while(true) will eventually terminate? Just specify an ordinal as the counter. Though if you mess up, the compiler might hang trying to compute ω^ω.
METABYTE studio's take
While the world debates yet another JS framework, someone's writing a compiler for infinity. If your project needs strong termination guarantees, we can help — but we'll probably skip ordinals to avoid explaining to the client why their feature "hangs on omega."
NEXT STEP
Liked the approach?
We apply the same principles to client projects: AI, automation, products that don't die after launch.