CS Compendium · Part IV — Programming Languages & Their Implementation
How languages are designed (syntax, semantics, type systems) and how they are made to run (lexing, parsing, compilation, and the runtime that manages execution and memory). This is the part with the most direct gravity for the Koder Stack, because the Stack is a language implementer: Koda is a self-hosting language with its own
kparsefront-end, backend, and runtime.
Why this part is the seed
Every other CS part touches this one (algorithms are expressed in languages; systems are built in them), but the Stack's decision to author its own language makes language implementation a working, not academic, concern here. The chapters below start from the runtime frontier the Stack is actively deciding — memory management — and grow outward.
The map of this part
| Doc | Content | Status |
|---|---|---|
01-overview |
Language design → implementation pipeline; where memory management sits | seeded |
02-memory-management |
Automatic memory management: tracing GC, reference counting & its renaissance, mark-region, and the beyond-GC approaches (ownership, regions, generational references) | seeded (real content) |
03-type-systems |
Staticdynamic, inference, linearaffine, dependent | planned |
04-compilers-and-parsing |
Lexing, parsing, IR, codegen, self-hosting | planned |
05-runtime-and-execution |
Interpreters, JIT, calling conventions, FFI | planned |