A review of classical array operators for the synthesis of combinatorial logic is presented. A new class of operators, which are implementable by explicit programming, are introduced. The new operators are related to the classical operators and comparisons are made. Further extensions to these operators to form cube array manipulators are discussed. Criteria are established for algorithms which can be implemented more efficiently. These algorithms progress from direct substitution for the classical operators to algorithms conceived in the new domain. Experimental results verify that the algorithms using the new operators are indeed more efficient and conform more closely to the established criteria. Possible extensions for the software, to form more complete, user orientated packages are discussed.