Show HN: Wyzer Programming Language
Points and comments are a snapshot, not live.
Wyzer is a statically typed language aiming to unify memory, thread, and network safety under one ownership rule.
Wyzer uses Perceus reference counting for fast memory management without Rust's complexity, and choreographic programming to prevent distributed deadlocks, protocol mismatches, and cross-service errors at compile time. Borrowed from Koka, Lean 4, and academic research, the language applies one ownership rule to memory, threads, and networks. Variables are immutable by default, errors return `Result<T, E>`, and there is no `async`/`await`. The project is early-stage research; some big problems remain unsolved. Documentation and examples are under active development.
What commenters are saying
Commenters broadly find the concept interesting but criticize the README for hiding its novel features-choreographic programming and Perceus memory-behind links to RESEARCH.md instead of showing examples upfront. A detailed explanation from a commenter clarifies that choreographic programming makes deadlocks syntactically impossible by expressing sends and receives as a single atomic instruction. Several ask for practical examples of multithreaded networking or non-trivial data structures to prove the memory model works. The author responds that docs and examples are in progress.