{'fraction_non_alphanumeric': 0.020026702269692925, 'fraction_numerical': 0.0, 'mean_word_length': 4.9523809523809526, '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}}
Inferring types and effects via static single assignment

The static single assignment form which is used by compilers of imperative programming languages is, as noted by Kelsey, a functional language. Local mutability is removed by renaming variables, and control flow is split into basic blocks, which are, in turn, a set of mutually recursive lambda abstractions. This suggests that such constructs could be used as the foundation for a functional language. In this paper, we present the core of a purely functional programming language with an imperative look-and-feel and with a type and effect system based on that of Leijen's Koka. We also discuss our initial results with a prototype implementation and a type and effect inference algorithm.