<bibliography>
 <citation type="unpublished" key="dedukti">
  <author>Ali <surname>Assaf</surname></author>
  <author>Guillaume <surname>Burel</surname></author>
  <author>Rapha&#235;l <surname>Cauderlier</surname></author>
  <author>David <surname>Delahaye</surname></author>
  <author>Gilles <surname>Dowek</surname></author>
  <author>Catherine <surname>Dubois</surname></author>
  <author>Fr&#233;d&#233;ric <surname>Gilbert</surname></author>
  <author>Pierre <surname>Halmagrand</surname></author>
  <author>Olivier <surname>Hermant</surname></author>
  <author>Ronan <surname>Saillard</surname></author>
  <year>2018</year>
  <title>Expressing theories in the &#955;&#928;-calculus modulo theory and in the Dedukti system</title>
  <url>http://www.lsv.fr/~dowek/Publi/expressing.pdf</url>
  <note>Submitted paper</note>
 </citation>
 <citation type="article" key="debruijn">
  <author>N.G <surname>de Bruijn</surname></author>
  <year>1972</year>
  <title>Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem</title>
  <journal>Indagationes Mathematicae (Proceedings)</journal>
  <volume>75</volume>
  <number>5</number>
  <pages>381 &#8211; 392</pages>
  <url>https://doi.org/10.1016/1385-7258(72)90034-0</url>
 </citation>
 <citation type="article" key="nameless">
  <author>Arthur <surname>Chargu&#233;raud</surname></author>
  <year>2012</year>
  <title>The Locally Nameless Representation</title>
  <journal>J. Autom. Reasoning</journal>
  <volume>49</volume>
  <number>3</number>
  <pages>363&#8211;408</pages>
  <url>https://doi.org/10.1007/s10817-011-9225-2</url>
 </citation>
 <citation type="inproceedings" key="phoas">
  <author>Adam <surname>Chlipala</surname></author>
  <year>2008</year>
  <title>Parametric higher-order abstract syntax for mechanized semantics</title>
  <booktitle>ICFP</booktitle>
  <publisher>ACM</publisher>
  <pages>143&#8211;156</pages>
  <url>http://doi.acm.org/10.1145/1411204.1411226</url>
 </citation>
 <citation type="misc" key="normaliser">
  <author><surname>Christophe Raffalli</surname></author>
  <year>1995</year>
  <title>A Normaliser for Pure and Typed &#955;-Calculus</title>
  <url>https://lama.univ-savoie.fr/~raffalli/normaliser.html</url>
  <note>First version implemented in Caml Light</note>
 </citation>
 <citation type="misc" key="pml">
  <author><surname>Christophe Raffalli</surname></author>
  <year>2007</year>
  <title>PML: a new proof assistant</title>
  <url>http://lama.univ-savoie.fr/~raffalli/pml</url>
  <note>Prototype implementation</note>
 </citation>
 <citation type="article" key="nested">
  <author>Andr&#233; <surname>Hirschowitz</surname></author>
  <author>Marco <surname>Maggesi</surname></author>
  <year>2012</year>
  <title>Nested Abstract Syntax in Coq</title>
  <journal>J. Autom. Reasoning</journal>
  <volume>49</volume>
  <number>3</number>
  <pages>409&#8211;426</pages>
  <url>https://doi.org/10.1007/s10817-010-9207-9</url>
 </citation>
 <citation type="misc" key="lambdapi">
  <author>Rodolphe <surname>Lepigre</surname></author>
  <year>2017</year>
  <title>Lambdapi: a new implementation of Dedukti</title>
  <url>https://github.com/rlepigre/lambdapi</url>
 </citation>
 <citation type="phdthesis" key="phd">
  <author>Rodolphe <surname>Lepigre</surname></author>
  <year>2017</year>
  <title>Semantics and Implementation of an Extension of ML for Proving Programs. (S&#233;mantique et Implantation d'une Extension de ML pour la Preuve de Programmes)</title>
  <school>Grenoble Alpes University, France</school>
 </citation>
 <citation type="misc" key="subml">
  <author>Rodolphe <surname>Lepigre</surname></author>
  <author>Christophe <surname>Raffalli</surname></author>
  <year>2016</year>
  <title>Implementation of the SubML language</title>
  <url>https://github.com/rlepigre/subml</url>
 </citation>
 <citation type="misc" key="pml2">
  <author>Rodolphe <surname>Lepigre</surname></author>
  <author>Christophe <surname>Raffalli</surname></author>
  <year>2017</year>
  <title>Implementation of the PML_2 proof system</title>
  <url>https://github.com/rlepigre/pml</url>
 </citation>
 <citation type="inproceedings" key="hoas">
  <author>Frank <surname>Pfenning</surname></author>
  <author>Conal <surname>Elliott</surname></author>
  <year>1988</year>
  <title>Higher-Order Abstract Syntax</title>
  <booktitle>PLDI</booktitle>
  <publisher>ACM</publisher>
  <pages>199&#8211;208</pages>
  <url>https://doi.org/10.1145/960116.54010</url>
 </citation>
 <citation type="article" key="fresh3">
  <author>Andrew M. <surname>Pitts</surname></author>
  <author>Mark R. <surname>Shinwell</surname></author>
  <year>2008</year>
  <title>Generative Unbinding of Names</title>
  <journal>Logical Methods in Computer Science</journal>
  <volume>4</volume>
  <number>1</number>
  <url>https://doi.org/10.2168/LMCS-4(1:4)2008</url>
 </citation>
 <citation type="misc" key="alphacaml">
  <author>Fran&#x00e7;ois <surname>Pottier</surname></author>
  <year>2005</year>
  <title>C&#945;ml</title>
  <url>http://gallium.inria.fr/~fpottier/alphaCaml/</url>
 </citation>
 <citation type="inproceedings" key="alphacamlpaper">
  <author>Fran&#x00e7;ois <surname>Pottier</surname></author>
  <year>2006</year>
  <title>An overview of C&#945;ml</title>
  <booktitle>ACM Workshop on ML</booktitle>
  <series>Electronic Notes in Theoretical Computer Science</series>
  <volume>148</volume>
  <pages>27&#8211;52</pages>
  <url>http://gallium.inria.fr/~fpottier/publis/fpottier-alphacaml.pdf</url>
 </citation>
 <citation type="misc" key="bindlib">
  <author><surname>Rodolphe Lepigre and Christophe Raffalli</surname></author>
  <year>2015</year>
  <title>The Bindlib OCaml Library Version 5</title>
  <url>https://github.com/rlepigre/ocaml-bindlib</url>
  <note>May be installed using the Opam package manager</note>
 </citation>
 <citation type="unpublished" key="toplas">
  <author><surname>Rodolphe Lepigre and Christophe Raffalli</surname></author>
  <year>2017-2018</year>
  <title>Practical Subtyping for Curry-Style Languages</title>
  <url>http://lepigre.fr/files/docs/lepigre2017_subml.pdf</url>
  <note>Under revision for publication in the TOPLAS journal</note>
 </citation>
 <citation type="article" key="fresh2">
  <author>Mark R. <surname>Shinwell</surname></author>
  <year>2006</year>
  <title>Fresh O'Caml: Nominal Abstract Syntax for the Masses</title>
  <journal>Electr. Notes Theor. Comput. Sci.</journal>
  <volume>148</volume>
  <number>2</number>
  <pages>53&#8211;77</pages>
  <url>https://doi.org/10.1016/j.entcs.2005.11.040</url>
 </citation>
 <citation type="article" key="fresh1">
  <author>Mark R. <surname>Shinwell</surname></author>
  <author>Andrew M. <surname>Pitts</surname></author>
  <author>Murdoch James <surname>Gabbay</surname></author>
  <year>2003</year>
  <title>FreshML: programming with binders made simple</title>
  <journal>SIGPLAN Notices</journal>
  <volume>38</volume>
  <number>9</number>
  <pages>263&#8211;274</pages>
  <url>http://doi.acm.org/10.1145/944746.944729</url>
 </citation>
</bibliography>
