Weekly ranking, Technology
The Goose Programming Language · Goose
88Original Thinker
An original language design writeup with concrete mechanisms and candid limits, though its performance claims rest on the author's own benchmarks.
What it adds
Presents a novel language design where all dynamic data lives on compiler-assigned bump stacks, giving memory safety without heap, GC or borrow rules, with self-reported benchmarks and explicit limitations.
Claim by claim
- 18 the author's own
- 0 an AI would say
- 0 known elsewhere
- 0 common knowledge
Its strongest original claims
- Goose is a memory-safe systems language with no heap allocator, garbage collector, or lifetime annotations.
- Over sixteen benchmarks Goose runs 3.3x idiomatic C++, 1.16x hand-optimized C++ and 1.12x best safe Rust speed, using 1.9x, 1.3x, 1.2x less memory.
- Every dynamic value lives inline on compiler-managed data stacks; growth advances a pointer and memory is freed at scope end.
- At most one resizable value is live per stack and always on top, so growth never moves anything or checks capacity.
- Freeing a structure with a million elements takes a single store regardless of nesting.
Scored by Expulp Verdict for what the piece adds beyond what is already known and published. The full verdict shows every claim with its reasons. Leaderboard, what Verdict gets right and where it is weak.