{'fraction_non_alphanumeric': 0.031078610603290677, 'fraction_numerical': 0.007312614259597806, 'mean_word_length': 5.765432098765432, '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}}
CSC in concurrent languages prototyping

In [11] we presented a compositional interpreter for a CSP-like language and we showed that, by using the ”continuation semantics for concurrency” (CSC) technique (recently introduced by us), denotational semantics can be used as a prototyping method for concurrent programming languages. In this paper we employ domains (which are complete partial orders) and continuous functions in developing a denotational semantics which is a mathematical formalization of the compositional interpreter given in [11].