Multi-clocked Guarded Recursion Beyond ω

Type theories with multi-clocked guarded recursion provide a flexible framework for programming with coinductive types encoding productivity in types. Combining this with solutions to general guarded domain equations one can also construct relatively simple denotational models of programming languages with advanced features. These constructions have previously been explored in the setting of extensional type theory through a presheaf model, which proves correctness of encodings of W-types. That model has been adapted to presheaves of cubical sets (functors into the category of cubical sets), where the model verifies correctness of encodings also of coinductive types whose definitions involve quotient inductive types such as finite powersets or finite distributions. Likewise the cubical model also verifies correctness of coinductive predicates defined using existential quantification and allows the results to be related to the global world of cubical sets. This paper looks at how to extend the extensional presheaf model of multi-clocked guarded recursion to higher ordinals, so that correctness of encodings of coinductive types can be extended from W-types to those involving finite powersets and finite distributions, as well as coinductive predicates involving existential quantification. This extension will allow results previously proved in Clocked Cubical Type Theory to be interpreted in a model based on set-theory, proving the correctness of these results as understood in their usual set theoretic interpretation.

💡 Research Summary

This paper investigates how to extend the presheaf model of multi‑clocked guarded recursion—originally developed for the ordinal ω—to larger, possibly uncountable, ordinals, thereby enabling the set‑theoretic interpretation of a range of results that have so far been proved only in Clocked Cubical Type Theory (CCTT). Guarded recursion equips a type theory with a delay modality ▹κ indexed by a clock κ; universal quantification over clocks (∀κ) allows one to “externalise” constructions performed in the internal world of the model (the “topos of trees”) to the ordinary world of sets. The central technical problem is that certain type constructors, notably the finite powerset functor P_f and the finite distribution functor D_f, do not commute with clock quantification in the standard ω‑indexed model, which prevents the externalisation of existential proofs and the modelling of nondeterministic or probabilistic languages in Set.

The authors first recall the syntax and semantics of Clocked Type Theory (CloTT), including its universes U_Δ indexed by finite sets of clocks, the delay modality, and the tick‑based rules for programming with guarded recursion. They then formalise the notion of a functor F commuting with clock quantification: there must exist an extension F′ acting on families indexed by a fresh clock such that the canonical map F(∀κ X) → ∀κ F′(X) is an isomorphism for all X. Under this condition, Theorem 2 (originally due to Atkey–McBride and later internalised) guarantees that the final coalgebra for F can be obtained as ∀κ µκ X.F(▹κ X).

The paper’s main contributions are threefold.

1. Conservativity over Set – By revisiting the presheaf construction of CloTT, the authors prove that the model is conservative over the standard set‑theoretic model of type theory. Consequently any derivation in CloTT is already valid in ordinary Set, a fact that had been implicit in earlier work but is now made explicit.

2. Commutation of Finitary Monads with Clock Quantification – Section 6 gives semantic conditions for a finitary monad on Set to commute with clock quantification when the indexing ordinal is sufficiently large (e.g., an uncountable cardinal). The authors provide a syntactic criterion on algebraic theories: all operations must be clock‑irrelevant (i.e., they do not depend on the clock variable) and the theory must be presented by equations that are preserved under universal quantification over clocks. Under these hypotheses, the induced monads—including the finite powerset monad P_f and the finite distribution monad D_f—satisfy the required commutation property.

3. Existential Quantification versus Clock Quantification – Section 7 analyses when ∃ and ∀κ can be swapped. By working in the proposition universes Prop_Δ (which are closed under ∃, ∀, ∧, ∨, etc.) and assuming clock‑irrelevance and tick‑irrelevance as axioms, the authors show that (∀κ ∃x φ) ≅ (∃x ∀κ φ) holds for any formula φ that does not mention the quantified clock. This result enables the externalisation of existence proofs that were previously confined to the internal “topos of trees” world.

With these technical tools the authors revisit several applications that were originally formalised in CCTT: (i) modelling nondeterministic languages via P_f, (ii) modelling probabilistic languages via D_f, (iii) proving (non‑)existence of distributive laws between the guarded delay monad and other monads, and (iv) reasoning about gradual typing. They demonstrate that each of these applications can be expressed in the internal language of the extended set‑theoretic model, provided the ordinal used for indexing is of sufficiently high cardinality. In other words, the same theorems proved in the cubical setting now hold in a purely set‑based semantics.

The metatheory employed throughout is classical ZFC set theory; the authors explicitly note that the proof of Theorem 8 (the commutation of existential quantification with clock quantification) relies on classical choice and other strong axioms, making it “very classical”.

In conclusion, the paper shows that multi‑clocked guarded recursion is not intrinsically tied to cubical structures or to the ω‑indexed topos of trees. By moving to larger ordinals and imposing natural algebraic conditions, one can obtain a clean set‑theoretic model that validates all the sophisticated constructions previously available only in Clocked Cubical Type Theory. This opens the way for formalising nondeterministic, probabilistic, and gradual‑typing languages in proof assistants that are based on ordinary type theory rather than on cubical type theory, while preserving the productivity guarantees and the rich semantic results that guarded recursion provides.