{'fraction_non_alphanumeric': 0.02472952086553323, 'fraction_numerical': 0.0, 'mean_word_length': 5.29126213592233, '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}}
The Pull-Tab Transformation

We present a new approach to the execution of functional logic programs. Our approach relies on definitional trees for the deterministic portions of a computation and on a graph transformation, called pull-tab, for the non-deterministic portions. This transformation moves, one level at a time, non-deterministic choices towards the root of the graph representing the state of a computation. With respect to needbased strategies for functional logic computations, our approach executes only localized graph replacements, a property that characterizes it as “pay as you go” and makes it suitable for parallel execution.