core premise
One language.
Every layer.
no tier ladder
A systems programming language whose ceiling of expressiveness equals the assembler’s — with abstractions that stay transparent in code generation. You always know what the machine does.
no tier ladder
Every construct emits code by a documented rule, so you predict the assembler from the source without running the compiler.
No hidden allocation, no hidden control flow, no vtables — behaviour follows from the source, its manifest, and the language conventions.
Operations are checked by default; inside an unchecked scope they are hardware-defined, never whatever suits the compiler.
There is one declaration form — name : type = value. Types, functions and generics are values written the same way, so there is nothing new to learn per layer.
name := valuedeclare and infer the type from the valuefn(…) -> Ta value-expression, exactly as struct {…} ispub · mut · comptimethree modifiers on three orthogonal axes## a declaration binds a name to whatever ## its right-hand side evaluates to Point := struct { x : u64, y : u64 } Meters := brand(u64) add := fn(a : u64, b : u64) -> u64 { a + b } Vec := fn(T : type) -> type { struct { ptr : ptr(T), len : usize } } comptime PI : f64 = 3.14159 mut count : u64 = 0