{'fraction_non_alphanumeric': 0.02369077306733167, 'fraction_numerical': 0.0, 'mean_word_length': 4.735714285714286, '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}}
Phase Distinctions In The Compilation Of EPIGRAM

We describe the execution of EPIGRAM on a stock architecture such as the G-machine, compiling via a core type theory and a supercombinator language. We show, via optimising transformations on the core type theory, that unused or duplicated values can be erased at run-time. Thus there exists a phase distinction, not between types and values, but between values which are used at compile-time only and values which are used at run-time. Through a simple example, lookup of a value in a sized vector, we show how our optimisations remove compile-time only values from terms and, furthermore, how we can use straightforward static analysis with our rich type information to avoid the need for any run-time bounds check when executing the lookup function.