Symmetries in boolean scans
Summary
Explains how boolean scans and folds are implemented and optimized in APL-like languages. It introduces practical, low-level bit-twiddling techniques (xorscan, andscan, ltscan) for fast prefix operations and discusses truth-table transformations and their impact on performance and code size. The post also connects these ideas to finite-state interpretations and offers Haskell equivalents.