B. Accattoli, Proof Pearl: Abella Formalization of ??-Calculus Cube Property, Second International Conference on Certified Programs and Proofs, pp.173-187, 2012.
DOI : 10.1007/978-3-642-35308-6_15
URL : https://hal.archives-ouvertes.fr/hal-00780337

J. Cheney and C. Urban, Alpha-Prolog: A logic programming language with names, binding, and alpha-equivalence, Logic Programming, 20th International Conference, pp.269-283, 2004.

J. Cheney and C. Urban, Nominal logic programming, ACM Transactions on Programming Languages and Systems, vol.30, issue.5, pp.1-47, 2008.
DOI : 10.1145/1387673.1387675
URL : http://arxiv.org/abs/cs/0609062

A. Church, A formulation of the simple theory of types, The Journal of Symbolic Logic, vol.1, issue.02, pp.56-68, 1940.
DOI : 10.2307/2371199

N. G. De-bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem, Indagationes Mathematicae, vol.34, issue.5, pp.381-392, 1972.

A. Felty and D. Miller, Encoding a dependent-type ??-calculus in a logic programming language, Proceedings of the 1990 Conference on Automated Deduction, pp.221-235, 1990.
DOI : 10.1007/3-540-52885-7_90
URL : https://hal.archives-ouvertes.fr/inria-00075299

A. Felty and A. Momigliano, Hybrid, Journal of Automated Reasoning, vol.18, issue.1, pp.43-105, 2012.
DOI : 10.1007/s10817-010-9194-x

A. Gacek, A Framework for Specifying, Prototyping, and Reasoning about Computational Systems, 2009.

A. Gacek, D. Miller, and G. , Nominal abstraction, Information and Computation, vol.209, issue.1, pp.48-73, 2011.
DOI : 10.1016/j.ic.2010.09.004
URL : http://doi.org/10.1016/j.ic.2010.09.004

A. Gacek, D. Miller, and G. Nadathur, A Two-Level Logic Approach to Reasoning About Computations, Journal of Automated Reasoning, vol.40, issue.4, pp.241-273, 2012.
DOI : 10.1007/s10817-011-9218-1
URL : https://hal.archives-ouvertes.fr/hal-00776208

C. Liang and D. Miller, Focusing and polarization in linear, intuitionistic, and classical logics, Theoretical Computer Science, vol.410, issue.46, pp.4747-4768, 2009.
DOI : 10.1016/j.tcs.2009.07.041

R. Mcdowell and D. Miller, Reasoning with higher-order abstract syntax in a logical framework, ACM Transactions on Computational Logic, vol.3, issue.1, pp.80-136, 2002.
DOI : 10.1145/504077.504080

D. Miller and G. Nadathur, Programming with Higher-Order Logic, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776197

D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.125-157, 1991.
DOI : 10.1016/0168-0072(91)90068-W

D. Miller and A. Tiu, A proof theory for generic judgments, ACM Transactions on Computational Logic, vol.6, issue.4, pp.749-783, 2005.
DOI : 10.1145/1094622.1094628

G. Nadathur and D. Miller, An Overview of ?Prolog, Fifth International Logic Programming Conference, pp.810-827, 1988.

F. Pfenning and C. Schürmann, System Description: Twelf ??? A Meta-Logical Framework for Deductive Systems, 16th Conf. on Automated Deduction (CADE), number 1632 in LNAI, pp.202-206, 1999.
DOI : 10.1007/3-540-48660-7_14

B. Pientka and J. Dunfield, Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description), Fifth International Joint Conference on Automated Reasoning, number 6173 in LNCS, pp.15-21, 2010.
DOI : 10.1007/978-3-642-14203-1_2

E. Polonowski, Automatically Generated Infrastructure for De Bruijn Syntaxes, Interactive Theorem Proving (ITP), pp.402-417, 2013.
DOI : 10.1007/978-3-642-39634-2_29

M. R. Shinwell, A. M. Pitts, and M. J. Gabbay, FreshML: Programming with binders made simple, Eighth ACM SIGPLAN International Conference on Functional Programming, pp.263-274, 2003.

Z. Snow, D. Baelde, and G. Nadathur, A meta-programming approach to realizing dependently typed logic programming, Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '10, pp.187-198, 2010.
DOI : 10.1145/1836089.1836113

C. Urban and J. Cheney, Avoiding Equivariance in Alpha-Prolog, Typed Lambda Calculi and Applications, Proceedings, pp.401-416, 2005.
DOI : 10.1007/11417170_29