Wyzer Programming Language

One rule: a resource used once cannot be used again. Wyzer, a statically typed compiled language whose compiler is written in OCaml, bets that this single rule can govern memory, threads and network messages alike, with neither a garbage collector nor a Rust style borrow checker in sight. Memory follows the Perceus reference counting model taken from Koka and Lean 4, so a value with exactly one owner gets updated in place even in functional-looking code.

For distributed code the language turns to choreographic programming. You write ordinary functions whose types record who owns each piece of data; the compiler derives the network rules from them and checks them, the goal being to catch deadlocks and dropped messages before the program ever runs. The surface syntax stays deliberately plain, with let for immutable bindings and var for mutable ones, failures returned as Result and handled by match, and no async/await split. The authors say outright that this is early research with several problems still unsolved.