{'fraction_non_alphanumeric': 0.02181818181818182, 'fraction_numerical': 0.0, 'mean_word_length': 5.559523809523809, '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}}
Compositional Graphs ?

In many applications, graphs are a natural representation for the structure of a problem domain. Since functional languages supports only (tree-structured) algebraic datatypes, there are various ways to represent graphs in declarative languages. In this paper we describe a representation of graphs in a functional logic language. Our representation is compositional as lists or tree structures are. This property makes our representation useful for many application domains, like graphical user interfaces or web programming.