A. Abel, Normalization by Evaluation, Dependent Types and Impredicativity, 2012.

D. Ahman, Handling Fibred Algebraic Effects, Proc. ACM Program. Lang. 2, POPL, Article, vol.7, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01672734

D. Ahman, N. Ghani, and G. D. Plotkin, Dependent Types and Fibred Computational Effects, 19th International Conference on Foundations of Software Science and Computation Structures, pp.36-54, 2016.

G. Barthe and T. Uustalu, CPS Translating Inductive and Coinductive Types, Proceedings of Partial Evaluation and Semantics-based Program Manipulation, pp.131-142, 2002.

A. Bizjak, R. Hans-bugge-grathwohl, . Clouston, L. Rasmus-ejlers-møgelberg, and . Birkedal, Guarded Dependent Type Theory with Coinductive Types, Foundations of Software Science and Computation Structures -19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, vol.9634, pp.20-35, 2016.

S. Boulier, P. Pédrot, and N. Tabareau, The Next 700 Syntactical Models of Type Theory, Proceedings of Certified Programs and Proofs, pp.182-194, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01445835

W. J. Bowman, Y. Cong, N. Rioux, and A. Ahmed, Type-preserving CPS translation of ? and ? types is not not possible, POPL, vol.2, p.33, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01672735

. Thierry-coquand, Canonicity and normalization for dependent type theory, Theor. Comput. Sci, vol.777, pp.184-191, 2019.

C. Führmann, Direct Models of the Computational Lambda-calculus, Electronic Notes in Theoretical Computer Science, vol.20, pp.245-292, 1999.

G. Gilbert, J. Cockx, M. Sozeau, and N. Tabareau, Definitional proof-irrelevance without K, PACMPL, vol.3, pp.1-3, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01859964

J. Girard, Linear Logic. Theor. Comput. Sci, vol.50, pp.1-102, 1987.

V. Glivenko, Sur Quelques Points de la Logique de M. Brouwer. Bulletins de la classe des sciences, vol.15, pp.183-188, 1929.

T. Griffin, A Formulae-as-Types Notion of Control, Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pp.47-58, 1990.

H. Herbelin, On the Degeneracy of Sigma-Types in Presence of Computational Classical Logic, Proceedings (Lecture Notes in Computer Science), Pawel Urzyczyn, vol.3461, pp.209-220, 2005.

G. Jaber, G. Lewertowski, P. Pédrot, M. Sozeau, and N. Tabareau, The Definitional Side of the Forcing, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.367-376, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01319066

G. Jaber, N. Tabareau, and M. Sozeau, Extending Type Theory with Forcing, LICS 2012 : Logic In Computer Science, pp.0-0, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00685150

J. Krivine, Classical Logic, Storage Operators and Second-Order lambda-Calculus, Ann. Pure Appl. Logic, vol.68, pp.90047-90054, 1994.

R. Lepigre, A Classical Realizability Model for a Semantical Value Restriction, Held as Part of the European Joint Conferences on Theory and Practice of Software, pp.476-502, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01107429

L. Paul-blain, Call-by-push-value, 2001.

L. Paul-blain, Possible World Semantics for General Storage in Call-By-Value, Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, pp.232-246, 2002.

L. Paul-blain, Contextual Isomorphisms, Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, pp.400-414, 2017.

P. Martin-löf, 100 years of Zermelo's axiom of choice: what was the problem with it?, Comput. J, vol.49, issue.3, pp.345-350, 2006.

E. Moggi, Notions of Computation and Monads. Information and Computation, vol.93, issue.1, pp.55-92, 1991.

G. Munch-maccagnoni, Models of a Non-Associative Composition, 17th International Conference on Foundations of Software Science and Computation Structures, Anca Muscholl, vol.8412, pp.396-410, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00996729

P. , M. Pédrot, and N. Tabareau, An effectful way to eliminate addiction to dependence, 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, pp.1-12, 2017.

P. , M. Pédrot, and N. Tabareau, Failure is Not an Option -An Exceptional Type Theory, Held as Part of the European Joint Conferences on Theory and Practice of Software, pp.245-271, 2018.

, The Univalent Foundations Program. 2013. Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study

, Matthijs Vákár. 2015. A Framework for Dependent Types and Effects

M. Vákár, Search of Effectful Dependent Types. Ph.D. Dissertation, 2017.

A. Wright, Simple Imperative Polymorphism, LISP and Symbolic Computation, pp.343-356, 1995.