Boolean shortcutting

Consider the reduction / on a boolean array. Any 1 in a row causes that row's result to be 1.

This allows us to change / from an arithmetic problem to a search problem.

In fact, reduction of a vector by any of the boolean functions ∧∨⍲⍱<>≤≥ is entirely determined by the vector's length and the location of its first 0 or 1 (depending on the function).