Optimized Ludus
The Rust-based interpreter is going to be way faster than the Janet-based interpreter. But we want Ludus to be a reasonably fast language, and I don't think a tree-walk situation will get us there. So this includes the "low-hanging fruit" optimizations, such as: bytecode-based VM; opportunistic mutation; tuples on the stack; interning strings and keywords; using spans and indexes instead of Strings everywhere.
No due date
0% Completed
