Abstract. We present the topos S of trees as a model of guarded recursion. We study the internal dependently-typed higher-order logic of S and show that S models two modal operators, on predicates and types, which serve as guards in recursive definitions of terms, predicates, and types. In particular, we show how to solve recursive type equations involving dependent types. We propose that the internal logic of S provides the right setting for the synthetic construction of abstract versions of step-indexed models of programming languages and program logics. As an example, we show how to construct a model of a programming language with higher-order store and recursive types entirely inside the internal logic of S. Moreover, we give an axiomatic categorical treatment of models of synthetic guarded domain theory and prove that, for any complete Heyting algebra A with a wellfounded basis, the topos of sheaves over A forms a model of synthetic guarded domain theory, generalizing the results for S.
Birkedal et al. REF introduced dependent type theory with the ⊲ modality, with semantics in the topos of trees.
First steps in synthetic guarded domain theory: step-indexing in the topos of trees
LMCS 8 (4:1) 2012
Computer Science Mathematics