The Language Stack: From Silicon to Semantics

It is 2026, and a language model can generate a lexer, a typechecker, and a working compiler in seconds. So why learn to buildthem by hand? Because a generated artifact is an assertion -and an assertion you cannot evaluate is not knowledge, it is a hopewith good syntax. The value was never in the typing.This book carries one language - Lark, the Lambda Affine ResourceKernel - from a real instruction set to a machine-checked proofthat its meaning is sound, treating the hardware, the theory, andthe proof as a single argument. You begin at the silicon and buildupward through lexer, parser, type system, interpreter, andoptimizer, to a code generator that runs Lark as native code on anaffordable Raspberry Pi Pico 2/2W.Theory is earned, not assumed: Hindley-Milner inference, affineownership, and traits, each introduced when the implementation needsit. And the book teaches the discipline that code-generating toolsdemand - an interpreter that defines what a program means,a differential-testing harness that says which back end is wrong, atype-safety theorem that bounds what any transformation may do. Andthen it turns that machinery on itself: the finished compiler isfuzzed, the tests are checked with planted bugs, and even the proofkernel is attacked until it gives up its own flaws - because aguarantee is worth exactly as much as the adversary it has survived.For the technically literate programmer who has always meant tounderstand what is under their language and never found the entrypoint. It assumes familiarity with Python or C and basic datastructures - but not a line of compiler theory.