Qi Accelerated – Qi 4 release announcement

> On functional computations involving standard higher order functions like map, filter, and foldl/foldr, Qi achieves something like a 3x speedup over equivalent code written in plain Racket! It does this by employing the stream fusion / deforestation optimization (the same one used in Haskell's GHC) which traverses input collections just once, and avoids constructing intermediate representations on the way to the final result.