Koka

Functional programming’s performance problem was never real—compilers were just not smart enough. Koka uses Perceus reference counting to statically prove unique ownership, allowing pure functional code to compile into in-place mutations as fast as C. The debate is over.