A. Abel, J. Ohman, and A. Vezzosi, Decidability of conversion for type theory in type theory, PACMPL 2(POPL), pp.1-2329, 2018.
DOI : 10.1109/LICS.2008.44
URL : http://dl.acm.org/ft_gateway.cfm?id=3158111&type=pdf

T. Altenkirch and A. Kaposi, Type Theory in Type Theory Using Quotient Inductive Types, pp.18-29, 2016.
DOI : 10.1145/2914770.2837638
URL : http://eprints.nottingham.ac.uk/31169/1/popl16main-mainpopl16-157-p-6ba8421-25791-preprint.pdf

A. Anand and G. Morrisett, Revisiting Parametricity: Inductives and Uniformity of Propositions. In: CoqPL'18, 2018.

M. Armand, B. Grégoire, A. Spiwack, and L. Théry, Extending Coq with Imperative Features and Its Application to SAT Verification, Interactive Theorem Proving, pp.83-98, 2010.
DOI : 10.1007/978-3-642-14052-5_8
URL : https://hal.archives-ouvertes.fr/inria-00502496

B. Barras, Auto-validation d'un système de preuves avec familles inductives, Thèse de doctorat, 1999.

J. P. Bernardy, P. Jansson, and R. Paterson, Proofs for free, Journal of Functional Programming, vol.83, issue.02, pp.107-152, 2012.
DOI : 10.1007/BFb0037116

S. Boulier, P. M. Pédrot, and N. Tabareau, The next 700 syntactical models of type theory, Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, CPP 2017, pp.182-194, 2017.
DOI : 10.1109/LICS.1989.39193
URL : https://hal.archives-ouvertes.fr/hal-01445835

J. Chapman, Type Theory Should Eat Itself, Electronic Notes in Theoretical Computer Science, vol.228, pp.21-36, 2008.
DOI : 10.1016/j.entcs.2008.12.114
URL : https://doi.org/10.1016/j.entcs.2008.12.114

A. Chlipala, Certified Programming with Dependent Types, 2011.

D. Devriese and F. Piessens, Typed Syntactic Meta-programming, ICFP '13, pp.73-86, 2013.
DOI : 10.1145/2544174.2500575
URL : https://lirias.kuleuven.be/bitstream/123456789/404549/1/icfp002-devriese-authorversion.pdf

G. Ebner, S. Ullrich, J. Roesch, J. Avigad, and L. De-moura, A metaprogramming framework for formal verification, Proceedings of the ACM on Programming Languages, vol.1, issue.ICFP, pp.1-3429, 2017.
DOI : 10.1017/S0956796815000118
URL : http://dl.acm.org/ft_gateway.cfm?id=3110278&type=pdf

Y. Forster and F. Kunze, Verified Extraction from Coq to a Lambda-Calculus, p.2016, 2016.

G. Jaber, G. Lewertowski, P. M. 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.
DOI : 10.1007/BFb0014566
URL : https://hal.archives-ouvertes.fr/hal-01319066

C. Keller and M. Lasson, Parametricity in an Impredicative Sort, p.6336, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00730913

M. Lasson, Canonicity of Weak ??-groupoid Laws Using Parametricity Theory, Electronic Notes in Theoretical Computer Science, vol.308, pp.229-244, 2014.
DOI : 10.1016/j.entcs.2014.10.013
URL : https://hal.archives-ouvertes.fr/hal-01105252

G. Malecha and J. Bengtson, ESOP 2016, chap. Extensible and Efficient Automation Through Reflective Tactics, pp.532-559, 2016.

G. M. Malecha, Extensible Proof Engineering in Intensional Type Theory, 2014.

E. Mullen, S. Pernsteiner, J. R. Wilcox, Z. Tatlock, and D. Grossman, OEuf: minimizing the Coq extraction TCB, Proceedings of CPP 2018, pp.172-185, 2018.
DOI : 10.1145/3176245.3167089

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

J. C. Reynolds, Types, Abstraction and Parametric Polymorphism, pp.513-523, 1983.

T. Sheard and S. P. Jones, Template Meta-programming for Haskell. SIGPLAN Not, pp.60-75, 2002.
DOI : 10.1145/636517.636528
URL : http://radio.weblogs.com/0100945/gems/spj_meta-haskell.pdf

M. Sozeau, Program-ing Finger Trees in Coq, pp.13-24, 2007.

W. Taha and T. Sheard, Multi-stage Programming with Explicit Annotations, pp.203-217, 1997.
DOI : 10.1145/258993.259019
URL : http://cse.ogi.edu/~walidt/paper-2.ps

P. Wadler, Theorems for free!, Proceedings of the fourth international conference on Functional programming languages and computer architecture , FPCA '89, pp.347-359, 1989.
DOI : 10.1145/99370.99404

P. Van-der-walt and W. Swierstra, Engineering Proof by Reflection in Agda, 2013.
DOI : 10.1007/978-3-642-41582-1_10
URL : https://hal.archives-ouvertes.fr/hal-00987610

B. Ziliani, D. Dreyer, N. R. Krishnaswami, A. Nanevski, and V. Vafeiadis, Mtac: A Monad for Typed Tactic Programming in Coq, Journal of Functional Programming, vol.25, 2015.

B. Ziliani and M. Sozeau, Abstract, Journal of Functional Programming, vol.9, p.10, 2017.
DOI : 10.1016/0304-3975(90)90108-T