It is well known that the functional programming paradigm provides certain advantages, namely increasing the reliability of software development, improving software verification and validation, providing software artefact reusability, and scaling software solutions. But this paradigm is not free from disadvantages also. The most serious of them are redundantly memory usage and low-performance productivity. The ideas concerning the implementation of randomization mechanisms into reduction strategies, which is a significant part of the kernel of functional computing systems, are considered in the paper. The authors present simulation tools for studying such a mechanism and give their grounding. They also present the experimental results of the comparison analysis of variants reduction randomization.