{'fraction_non_alphanumeric': 0.015952143569292122, 'fraction_numerical': 0.0, 'mean_word_length': 4.7371428571428575, '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}}
Strong functors and interleaving fixpoints in game semantics

We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes and equip it with reduction rules allowing a sound translation of Godel’s system T. We introduce the notion of a μ -closed category , relying on a uniform interpretation of open μLJ formulas as strong functors. We show that any μ -closed category is a sound model for μLJ . We then turn to the construction of a concrete μ -closed category based on Hyland-Ong game semantics. The model relies on three main ingredients: the construction of a general class of strong functors called open functors acting on the category of games and strategies, the solution of recursive arena equations by exploiting cycles in arenas, and the adaptation of the winning conditions of parity games to build initial algebras and terminal coalgebras for many open functors. We also prove a weak completeness result for this model, yielding a normalisation proof for μLJ .