{'fraction_non_alphanumeric': 0.02195121951219512, 'fraction_numerical': 0.0, 'mean_word_length': 5.044117647058823, '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}}
Doing Lattice Theory in Higher Order LogicJ

We show how the abstract theory of (complete, boolean) lattices can be for-malised as a theory in the HOL theorem prover. The abstract lattice theory can be instantiated for concrete cases, providing immediate instantiations of many useful results. In particular, we treat the abstract theory of function lattices as an instantiation of the abstract lattice theory.