S. Ambler, M. Kwiatkowska, and N. Measor, Duality and the completeness of the modal ??-calculus, Theoretical Computer Science, vol.151, issue.1, pp.3-27, 1995.
DOI : 10.1016/0304-3975(95)00045-X

S. Awodey, K. Kishida, and H. Kotzsch, Topos Semantics for Higher-Order Modal Logic, pp.13-30, 2014.

C. Baier and J. Katoen, Principles of Model Checking, 2008.

L. Birkedal, R. E. Møgelberg, J. Schwinghammer, and K. Støvring, First steps in synthetic guarded domain theory: step-indexing in the topos of trees, Logical Methods in Computer Science, vol.8, issue.4, p.14, 2011.

P. Blackburn, M. De-rijke, and Y. Venema, Modal Logic. Cambridge Tracts in Theoretical Computer Science, 2002.
URL : https://hal.archives-ouvertes.fr/inria-00100502

C. Kupke, A. Kurz, and Y. Venema, Stone coalgebras, Theoretical Computer Science, vol.327, issue.1-2, pp.109-134, 2004.
DOI : 10.1016/j.tcs.2004.07.023

R. Clouston, A. Bizjak, H. B. Grathwohl, and L. Birkedal, The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types, Logical Methods in Computer Science, vol.12, issue.3, 2016.
DOI : 10.2168/LMCS-12(3:7)2016

D. Dreyer, G. Neis, A. Rossberg, and L. Birkedal, A Relational Modal Logic for Higher-order Stateful ADTs, Proceedings POPL'10, pp.185-198, 2010.

S. Ghilardi and G. C. Meloni, Modal and tense predicate logic: Models in presheaves and categorical conceptualization, Categorical Algebra and its Applications, LNM, pp.130-142, 1988.
DOI : 10.1093/acprof:oso/9780198243113.001.0001

V. Goranko and M. Otto, 5 Model theory of modal logic, Handbook of Modal Logic of Studies in Logic and Practical Reasoning, pp.249-329, 2007.
DOI : 10.1016/S1570-2464(07)80008-5

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Trace Semantics via Coinduction, Logical Methods in Computer Science, vol.3, issue.4, p.15, 2007.
DOI : 10.2168/LMCS-3(4:11)2007

B. Jacobs, Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study, RAIRO - Theoretical Informatics and Applications, vol.9, issue.1, pp.31-59, 2001.
DOI : 10.1093/logcom/9.5.601

B. Jacobs, Trace Semantics for Coalgebras, Proceedings of CMCS'04, p.15, 2004.
DOI : 10.1016/j.entcs.2004.02.031

P. T. Johnstone, Stone Spaces. Cambridge Studies in Advanced Mathematics, 1986.

P. T. Johnstone, Sketches of an Elephant: A Topos Theory Compendium. Oxford Logic Guides, pp.12-28, 2002.

A. Joyal and M. I. , A completeness theorem for open maps, Annals of Pure and Applied Logic, vol.70, issue.1, pp.51-86, 1994.
DOI : 10.1016/0168-0072(94)90069-8

A. Joyal and I. Moerdijk, Algebraic Set Theory. Lecture note series, 1995.

A. Joyal, M. Nielsen, and G. Winskel, Bisimulation from Open Maps, Information and Computation, vol.127, issue.2, pp.164-185, 1996.
DOI : 10.1006/inco.1996.0057

H. Kotzsch, Topos Semantics for Higher-Order Modal Logic, p.13, 2003.

D. Kozen, Results on the Propositional ??-Calculus, Special Issue Ninth International Colloquium on Automata, Languages and Programming (ICALP) Aarhus, pp.333-354, 1982.
DOI : 10.7146/dpb.v11i146.7420

S. and M. Lane, Categories for the Working Mathematician, p.18, 1998.
DOI : 10.1007/978-1-4612-9839-7

S. , M. Lane, and I. Moerdijk, Sheaves in geometry and logic: A first introduction to topos theory, p.30, 1992.

M. Makkai and G. Reyes, Completeness results for intuitionistic and modal logic in a categorical setting, Annals of Pure and Applied Logic, vol.72, issue.1, pp.25-101, 1995.
DOI : 10.1016/0168-0072(93)00085-4

R. E. Møgelberg, A type theory for productive coprogramming via guarded recursion, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, 2005.
DOI : 10.1145/2603088.2603132

R. E. Møgelberg and M. Paviotti, Denotational semantics of recursive types in synthetic guarded domain theory, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.317-326, 2016.
DOI : 10.1007/978-3-642-54833-8_9

H. Nakano, A modality for recursion, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.255-266, 2000.
DOI : 10.1109/LICS.2000.855774

C. L. Ong, On Model-Checking Trees Generated by Higher-Order Recursion Schemes, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.81-90, 2006.
DOI : 10.1109/LICS.2006.38

M. Paviotti, R. E. Møgelberg, and L. Birkedal, A Model of PCF in Guarded Type Theory, Electronic Notes in Theoretical Computer Science, vol.319, issue.C 1, pp.333-349, 2015.
DOI : 10.1016/j.entcs.2015.12.020

G. E. Reyes and H. Zolfaghari, Topos-theoretic approaches to modality, Category Theory: Proceedings of the International Conference, pp.359-378, 1990.
DOI : 10.1007/BF01303275

L. Santocanale and Y. Venema, Completeness for flat modal fixpoint logics, Annals of Pure and Applied Logic, vol.162, issue.1, pp.55-82, 2010.
DOI : 10.1016/j.apal.2010.07.003
URL : https://hal.archives-ouvertes.fr/hal-00346782

Y. Venema, 6 Algebras and coalgebras, Handbook of Modal Logic of Studies in Logic and Practical Reasoning, pp.331-426, 2007.
DOI : 10.1016/S1570-2464(07)80009-7

G. Winskel and M. Nielsen, Models for Concurrency, Handbook of Logic in Computer Science, pp.1-148, 1995.

A. Proofs and §. , 18 A.1 Proofs of §2.1 (The Topos of Trees), 18 B Proofs of §3 (Modal Logic of Transition Systems in the Topos of Trees, p.18

D. Proofs and §. , 23 E Proofs of §6.1 (A Geometric Morphism) 24 F Proofs of §6 (Extensions), 29 F.1 Proofs of §6.2 (Accommodating an S4 Reverse Modality) . . . . . . . 29 F.2 Proofs of §6.3 (Extension to the Modal µ-Calculus), p.30