{'fraction_non_alphanumeric': 0.01652892561983471, 'fraction_numerical': 0.006611570247933884, 'mean_word_length': 5.516129032258065, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Array Optimizations in OCaml

OCaml is a modern programming language with many advanced features, yet its strict sequential semantics and consequent lack of support for locality-enhancement optimizations on arrays prohibit its use in numerically intensive computation. In this paper we show that it is possible to perform such optimizations by creating safe regions in which array bounds checking is unnecessary. These optimizations can be performed (mostly) automatically by a prototype implementation that we describe. Performance gains from the optimizations range from 37-94% on simple matrix kernels.