Generalized combinators in functional languages and their applications

The author attempts to generalize several combinators introduced in functional languages and formulate an algebraic law that subsumes many of the existing laws. The combinators also map to efficient implementations both in digital circuits and imperative programming languages. He introduces `array´ and `composition´ combinators, which have the following interesting properties. Array is the generalization of a comprehensive set of combinators: map, reduce, generate, until, and filter. `Composition´ covers application and construction. The associated algebraic law (composition of arrays) is generalization of various laws associated with the special cases of those combinators. However, the combinators are very simple and can be recommended as expressive and intuitively clear program-forming operators. The combinators directly map to efficient implementations both in digital circuits and imperative programming languages