{'fraction_non_alphanumeric': 0.015906680805938492, 'fraction_numerical': 0.0, 'mean_word_length': 4.9, '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}}
On the correctness of object classes

The cardinal purpose of teaching programming is to demonstrate a method of developing correct programs. Reliability and correctness are especially important in cases of programs that are intended for multiple reuse. The most characteristic examples of such program-tools are the ones belonging to data types (or data type classes). The method we outline for program development assists in producing correct programs with mathematical formalism. The main point of this method is that we declare statements that refer to the examination of the abstract type class’s operations formulated with algorism. Since there are well-known methods for proving these statements, we do not have to deal with it in this paper. We are going to apply a single example throughout the article. The theorems we need to support our steps are to be declared, but our methods generally do not require elaboration of their proof.