A. Asperti, W. Ricciotti, C. Sacerdoti-coen, and E. Tassi, Hints in unification, Theorem Proving in Higher Order Logics, pp.84-98, 2009.

M. Boespflug, Q. Carbonneaux, and O. Hermant, The ? ?-calculus modulo as a universal proof language, Proceedings of PxTP2012: Proof Exchange for Theorem Proving, pp.28-43, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00917845

J. Carette and R. O'connor, Theory Presentation Combinators, Intelligent Computer Mathematics, vol.7362, pp.202-215, 2012.

D. Christiansen and E. Brady, Elaborator reflection: extending Idris in Idris, International Conference on Functional Programming, pp.284-297, 2016.

D. Cousineau and G. Dowek, Embedding pure type systems in the lambda-pi-calculus modulo, Typed Lambda Calculi and Applications, pp.102-117, 2007.

C. Dunchev, F. Guidi, C. Sacerdoti-coen, and E. Tassi, ELPI: Fast, Embeddable, lambda-Prolog Interpreter, Logic for Programming, pp.460-468, 2015.

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, 2017.

A. Felty and A. Momigliano, Hybrid -a definitional two-level approach to reasoning with higher-order abstract syntax, Journal of Automated Reasoning, vol.48, issue.1, pp.43-105, 2012.

A. Gacek, The Abella interactive theorem prover (system description), Automated Reasoning, pp.154-161, 2008.

G. Gonthier and A. Mahboubi, A Small Scale Reflection Extension for the Coq system, INRIA, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00258384

R. Harper, F. Honsell, and G. Plotkin, A framework for defining logics, Journal of the Association for Computing Machinery, vol.40, issue.1, pp.143-184, 1993.

F. Honsell, L. Liquori, P. Maksimovic, and I. Scagnetto, LLFP: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads, Logical Methods in Computer Science, vol.13, issue.3, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01146059

M. Iancu, Towards Flexiformal Mathematics, 2017.

M. Kohlhase, D. Müller, S. Owre, and F. Rabe, Making PVS Accessible to Generic Services by Interpretation in a Universal Format, Interactive Theorem Proving, pp.319-335, 2017.

D. Müller, F. Rabe, and M. Kohlhase, Theories as types, 2018.

L. Paulson, Isabelle: A Generic Theorem Prover, Lecture Notes in Computer Science, vol.828, 1994.

F. Pfenning and C. Schürmann, System description: Twelf -a meta-logical framework for deductive systems, Automated Deduction, pp.202-206, 1999.

B. Pientka and J. Dunfield, Beluga: A Framework for Programming and Reasoning with Deductive Systems (System description), Automated Reasoning, pp.15-21, 2010.

F. Rabe, The MMT API: A Generic MKM System, Intelligent Computer Mathematics, pp.339-343, 2013.

F. Rabe, How to Identify, Translate, and Combine Logics?, Journal of Logic and Computation, vol.27, issue.6, pp.1753-1798, 2017.

F. Rabe, A Modular Type Reconstruction Algorithm, ACM Transactions on Computational Logic, 2018.

F. Rabe and M. Kohlhase, A Scalable Module System. Information and Computation, vol.230, issue.1, pp.1-54, 2013.

, The Univalent Foundations Program. Homotopy Type Theory: Univalent Foundations of Mathematics, 2013.

K. Watkins, I. Cervesato, F. Pfenning, and D. Walker, A Concurrent Logical Framework I: Judgments and Properties, 2002.