{'fraction_non_alphanumeric': 0.02023121387283237, 'fraction_numerical': 0.0, 'mean_word_length': 5.3577981651376145, '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}}
Dependent record types revisited

Dependently-typed records have been studied in type theory in several previous research attempts, with applications to the study of module mechanisms for both programming and proof languages. Recently, the author has proposed an improved formulation of dependent record types in the context of studying manifest fields of module types. In this paper, we study this formulation in more details by considering universes of record types and some application examples. In particular, we show that record types provide a more powerful mechanism (than record kinds) in expressing module types and additional useful means (as compared with Σ-types) in applications.