A. Ahmed, Step-indexed syntactic logical relations for recursive and quantified types. Programming Languages and Systems, pp.69-83, 2006.
DOI : 10.1007/11693024_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.3992

A. W. Ahmed, D. Dreyer, and A. Rossberg, State-dependent representation independence, Proceedings of the 36th ACM Symposium on Principles of Programming Languages, 2009.
DOI : 10.1145/1480881.1480925
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.2285

A. W. Appel and D. Mcallester, An indexed model of recursive types for foundational proof-carrying code, ACM Transactions on Programming Languages and Systems, vol.23, issue.5, pp.657-683, 2001.
DOI : 10.1145/504709.504712

A. W. Appel, P. Mellì-es, C. D. Richards, and J. Vouillon, A very modal model of a modern, major, general type system, Proceedings of the 34th ACM Symposium on Principles of Programming Languages, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00150978

J. Avigad, Forcing in proof theory. The Bulletin of Symbolic Logic, pp.305-333, 2004.

L. Birkedal, R. Møgelberg, J. Schwinghammer, and K. Støvring, First steps in synthetic guarded domain theory: step-indexing in the topos of trees, Logic in Computer Science, 2011.

L. Birkedal, B. Reus, J. Schwinghammer, K. Støvring, J. Thamsborg et al., Step-indexed Kripke models over recursive worlds, Proceedings of the 38th ACM Symposium on Principles of Programming Languages, 2011.
DOI : 10.1145/1925844.1926401
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.2081

P. J. Cohen and M. Davis, Set theory and the continuum hypothesis, 1966.

T. Coquand and G. Jaber, A Note on Forcing and Type Theory, Fundamenta Informaticae, vol.100, issue.1, pp.43-52, 2010.

U. Dal, L. , and M. Hofmann, A semantic proof of polytime soundness for light affine logic. Theory of Computing Systems, 2009.

D. Dreyer, A. Ahmed, and L. Birkedal, Logical step-indexed logical relations, Proceedings of the 24th Annual IEEE Symposium on Logic In Computer Science, 2009.
DOI : 10.2168/lmcs-7(2:16)2011
URL : http://arxiv.org/abs/1103.0510

D. Dreyer, G. Neis, and L. Birkedal, The impact of higherorder state and control effects on local relational reasoning, Proceedings of the 15th ACM International Conference on Functional programming, 2010.

D. Dreyer, G. Neis, A. Rossberg, and L. Birkedal, A relational modal logic for higher-order stateful ADTs, Proceedings of the 38th ACM Symposium on Principles of Programming Languages, 2010.

A. M. Pitts and I. D. Stark, Operational reasoning for functions with local state, Higher Order Operational Techniques in Semantics. CUP, 1998.

G. Plotkin and M. Abadi, A logic for parametric polymorphism, Typed Lambda Calculi and Applications, 1993.
DOI : 10.1007/BFb0037118

F. Pottier, A typed store-passing translation for general references, Proceedings of the 38th ACM Symposium on Principles of Programming Languages, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01081187

M. Tierney, Sheaf theory and the continuum hypothesis, LNM, vol.2743, issue.12, pp.13-4230, 1972.
DOI : 10.1007/BFb0073963