From https://github.com/google/rune/blob/main/benchmarks/mandelbr...
for k = 0u32, k < 8u32, k += 1 { cr0[k] = 2.0 * <f64>(8 * x + k) / <f64>width - 1.5; }
It's slot-based, vaguely like Python, and has reference-counting GC, like Python. That's how I understand it.
From https://github.com/google/rune/blob/main/benchmarks/mandelbr...