A Model of Countable Nondeterminism in Guarded Type Theory
Authors: Aleš Bizjak, Lars Birkedal and Marino Miculan
Paper Information
| Title: | A Model of Countable Nondeterminism in Guarded Type Theory |
| Authors: | Aleš Bizjak, Lars Birkedal and Marino Miculan |
| Proceedings: | RTA-TLCA 2014 LNCS Proceedings |
| Editor: | Gilles Dowek |
| Keywords: | countable choice, guarded recursion, step-indexing, program equivalence |
| Abstract: | ABSTRACT. We show how to construct a logical relation for countable nondeterminism in a guarded type theory, corresponding to the internal logic of the topos $Sh(\omega_1)$ of sheaves over $\omega_1$. In contrast to earlier work on abstract step-indexed models, we not only construct the logical relations in the guarded type theory, but also give an internal proof of the adequacy of the model with respect to standard contextual equivalence. To state and prove adequacy of the logical relation, we introduce a new propositional modality. In connection with this modality we show why it is necessary to work in the logic of $\Sh(\omega_1)$. |
| Pages: | 15 |
| Talk: | Jul 16 15:30 |
| Paper: | ![]() |
