Synthetic guarded domain theory (SGDT), is a field of synthetic mathematics that provides an alternative to synthetic domain theory, where all guarded recursive definitions have (guarded) fixed points.
More generally, the aim of synthetic domain theory is roughly that computability should be built in the logic. As a result, constructions on domains would be set-theoretic with no extra structure and proofs of continuity are for free. However, such a theory would yield an unrestricted fixed-point combinator at all types which would render the theory itself inconsistent when viewed as a logical system.
SGDT solves this problem by introducing a notion of “time”. For a type $A$, $\triangleright A$ is the type of computations available one step from now. The $\triangleright$ modality (pronounced “later”) yields a restricted fixed-point operator
at all types $A$, which is consistent when viewing this theory as a logical framework. In particular, it corresponds to Löb's theorem.
The original model of (single-clock) SGDT is the category of presheaves over $\omega$, the first infinite ordinal. The objects of this category, also known as the topos of trees, here named $\mathcal{S}$, are contravariant set-valued functors $X : \omega^{\text{op}} \to \text{Set}$ which have the following shape
where the maps $r_i$, for $i \in \omega^{\text{op}}$, are the restriction maps induced by the functor $X$. The arrows of this category are natural transformations between two functors (satisfying the naturality condition).
The later modality $\triangleright$ is an endofunctor in this category defined as $\triangleright A (1) = 1$ and $\triangleright A (n+1) = A(n)$, for an object $A$. Furthermore, for every object $X$ there exists an obvious map $\text{next} : X\to \triangleright X$ witnessing the fact that everything that is available now is also available later.
Inspired by terminology used in the metric spaces (see below), every map $X \to X$ in $\text{Set}^{\omega^\text{op}}$ is called non-expansive while a map $f : X \to X$ is contractive if it factors through the $\text{next}$ map, i.e. there exists a map $g : \triangleright X \to X$ such that $f = g \circ \text{next}$.
A $\triangleright$-algebra $(X, f)$ yields a natural transformation with components $f_1 : 1 \to X(1)$ and $f_i : X(i) \to X(i+1)$ commuting with the restriction maps of the object $X$. It can therefore be thought of as an $\omega$-chain as follows
The morphism $\text{fix}_f : 1 \to X$ is itself a natural transformation whose components are $f_1 \circ \dots f_{i-1} \circ f_{i} : 1 \to X(i)$, for all $i \in \omega^{\text{op}}$ satisfying
The idea here is that the recursive call is guarded by the $\text{next}$ map.
The category of complete bisected ultrametric spaces (BiCUlt) is a coreflective subcategory of the topos of trees (Proposition 5.1).
Moreover, the inclusion functor restricts to an equivalence of categories when considering objects in $\mathcal{S}$ whose restriction maps are surjective, which are sometimes called the total objects or flabby sheaves.
First, recall that every point in a ball $\mathcal{B}$ of an ultrametric space is at its centre while intersecting balls are contained into each other which means that closed $2^{-n}$-balls partition a space. Thus, we can partition a metric space $(X, d)$ by defining a family of equivalence relation
for all $n \in \mathbb{N}$. This family is also known as Complete Ordered Family of Equivalences (c.o.f.e) (Di Gianantonio and Miculan, 2003). Intuitively, $x$ and $y$ are equal at $n$ if they belong to the same $2^{-n}$-ball.
The inclusion functor $\iota: \text{BiCUlt} \hookrightarrow \mathcal{S}$ takes a metric space $(X,d)$ in CBUlt into the presheaf of its space decompositions
where each restriction map $(X/=_{(n+1)}) \to (X/=_{n})$ takes a $2^{-(n+1)}$-ball to the $2^{-n}$-ball that contains it.
The inclusion functor has a right adjoint $\mathcal{S} \to \text{BiCUlt}$ which maps a presheaf $X$ to the homset $\mathcal{S}(1, X)$ (the global elements of $X$). This is also the limit of $X$ when seen as a diagram in Set. The metric on $\mathcal{S}(1, X)$ is defined as
for natural transformations $x, y : 1 \to X$. Intuitively, this metric is the greatest lower bound on which the elements of $X$ agree.
A summary of these results can be found in Bizjak’s Ph.D. thesis (Bizjak 16, Section 1.2).
Palombi and Sterling provide the following simple axiomatization of a model of (single-clock) synthetic guarded domain theory:
An elementary topos $E$ with natural numbers object.
with a left exact endofunctor $\triangleright$
with a natural transformation $\text{next} \;\colon\; 1 \to \triangleright$ satisfying $\triangleright\text{next} = \text{next}\triangleright$
supporting Löb-induction, i.e., $\phi : \Omega|\triangleright \phi \Rightarrow \phi \vdash \phi$ in the internal logic of $E$.
Then “multi-clock” SGDT is simply a topos $E$ with an object of clocks $K \colon E$ such that the slice $E/K$ is a model of single-clock SGDT.
Mathematics in synthetic guarded domain theory can be formalized in the internal language of SGDT models. Several presentations have been proposed such as:
guarded dependent type theory (BGCMB2016) which is an extensional type theory
clocked cubical type theory (KMV2022), an intensional type theory extending cubical type theory.
Agda includes an implementation of some portions of clocked cubical type theory under the name Guarded Cubical Agda.
Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring, First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Logical Methods in Computer Science 8 4 (2012) [doi:10.2168/LMCS-8(4:1)2012]
Aleš Bizjak, Hans Bugge Grathwohl, Ranald Clouston, Rasmus E. Møgelberg, Lars Birkedal. Guarded Dependent Type Theory with Coinductive Types. FoSSaCS 2016 (doi)
Magnus Baunsgaard Kristensen, Rasmus Ejlers Møgelberg, Andrea Vezzosi Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks. LICS 2022 (preprint)
Daniele Palombi and Jonathan Sterling, Classifying topoi in synthetic guarded domain theory: The universal property of multi-clock guarded recursion. Mathematical Foundations of Program Semantics 2022 (doi)
Marco Paviotti, Denotational semantics in Synthetic Guarded Domain Theory. PhD thesis, IT University of Copenhagen (pdf)
Aleš Bizjak, On Semantics and Applications of Guarded Recursion. PhD thesis, Aarhus University (pdf)
Pietro Di Gianantonio, Marino Miculan, A Unifying Approach to Recursive and Co-recursive Definitions. In Geuvers, Wiedijk, editors, Proceedings of TYPES’02. LNCS 2646, 2003.
Last revised on November 23, 2022 at 23:24:30. See the history of this page for a list of all contributions to it.