{'fraction_non_alphanumeric': 0.015945330296127564, 'fraction_numerical': 0.0, 'mean_word_length': 5.027397260273973, '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}}
Linear Programming Languages

We formalize SlPCF, namely a programming language which is able to represent linear function between coherence spaces. We give an interpretation of SlPCF into the model of linear coherence spaces and we show that such semantics is fully abstract with respect to it. SlPCF is not syntactically linear, namely its programs can contain the same variable more than once. Last, we address the universality problem.