T. Michael-gordon-abbott, N. Altenkirch, and . Ghani, Containers: Constructing Strictly Positive Types, Theor. Comput. Sci, vol.342, pp.3-27, 2005.

T. Michael-gordon-abbott, N. Altenkirch, C. Ghani, and . Mcbride, Constructing Polymorphic Programs with Quotient Types, Mathematics of Program Construction (MPC), 2004.

, LNCS, vol.3125, pp.2-15

A. Abel and T. Altenkirch, A Predicative Strong Normalisation Proof for a ?-Calculus with Interleaving Inductive Types, Types for Proofs and Programs (TYPES) 1999, pp.21-40, 1956.

A. Abel, A. Momigliano, and B. Pientka, POPLMark Reloaded, Logical Frameworks and MetaLanguages: Theory and Practice (LFMTP) 2017, 2017.

P. Aczel and N. Mendler, A Final Coalgebra Theorem, Category Theory and Computer Science, vol.389, pp.357-365, 1989.
DOI : 10.1007/bfb0018361

B. Ahrens, A. Hirschowitz, A. Lafont, and M. Maggesi, High-Level Signatures and Initial Semantics, Computer Science Logic (CSL) 2018, vol.119, pp.1-4, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01930058

G. Allais, R. Atkey, J. Chapman, C. Mcbride, and J. Mckinna, A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs, Proc. ACM Program. Lang. 2, International Conference on Functional Programming (ICFP), vol.90, 2018.
DOI : 10.1145/3236785
URL : http://dl.acm.org/ft_gateway.cfm?id=3236785&type=pdf

T. Altenkirch, N. Ghani, P. Hancock, C. Mcbride, and P. Morris, Indexed Containers, J. Funct. Program, vol.25, 2015.
DOI : 10.1109/lics.2009.33

T. Altenkirch and B. Reus, Monadic Presentations of Lambda Terms using Generalized Inductive Types, Computer Science Logic (CSL) 1999, Jörg Flum and, vol.1683, pp.453-468, 1999.
DOI : 10.1007/3-540-48168-0_32
URL : http://www.tcs.informatik.uni-muenchen.de/ftp/alti/publ/CSL99.ps.Z

B. E. Aydemir, A. Bohannon, M. Fairbairn, J. N. Foster, B. C. Pierce et al., Mechanized Metatheory for the Masses: The PoplMark Challenge, Theorem Proving in Higher Order Logics (TPHOLs) 2005, vol.3603, pp.50-65, 2005.
DOI : 10.1007/11541868_4
URL : http://www.cis.upenn.edu/~baydemir/papers/poplmark.pdf

B. E. Aydemir, A. Bohannon, and S. Weirich, Nominal Reasoning Techniques in Coq (Extended Abstract), Electr. Notes Theor. Comput. Sci, vol.174, pp.69-77, 2007.
DOI : 10.1016/j.entcs.2007.01.028
URL : https://doi.org/10.1016/j.entcs.2007.01.028

B. E. Aydemir, A. Charguéraud, B. C. Pierce, R. Pollack, and S. Weirich, Engineering Formal Metatheory, Principles of Programming Languages, 2008.
DOI : 10.1145/1328897.1328443
URL : http://www.cis.upenn.edu/~bcpierce/papers/binders.pdf

, , pp.3-15

D. Baelde, K. Chaudhuri, A. Gacek, D. Miller, G. Nadathur et al., Abella: A System for Reasoning about Relational Specifications, J. Formalized Reasoning, vol.7, pp.1-89, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01102709

P. Henk and . Barendregt, The Lambda Calculus: Its Syntax and Semantics, Studies in Logic, vol.40, 1984.

F. Bergeron, G. Labelle, and P. Leroux, Combinatorial Species and Tree-Like Structures, Number 67 in Encyclopedia of Mathematics and Its Applications, 1997.

S. Berghofer and C. Urban, A Head-to-Head Comparison of de Bruijn Indices and Names, Electr. Notes Theor. Comput. Sci, vol.174, pp.53-67, 2007.

R. S. Bird and R. Paterson, De Bruijn Notation as a Nested Datatype, J. Funct. Program, vol.9, pp.77-91, 1999.

L. Jasmin-christian-blanchette, A. Gheri, D. Popescu, and . Traytel, Bindings as Bounded Natural Functors (Extended Version, 2019.

L. Jasmin-christian-blanchette, A. Gheri, D. Popescu, and . Traytel, Formalization associated with this paper, 2019.

J. Jasmin-christian-blanchette, A. Hölzl, L. Lochbihler, A. Panny, D. Popescu et al., Truly Modular (Co)datatypes for Isabelle/HOL, LNCS, vol.8558, pp.93-110, 2014.

F. Jasmin-christian-blanchette, A. Meier, D. Popescu, and . Traytel, Foundational Nonuniform (Co)datatypes for Higher-Order Logic, Logic in Computer Science (LICS) 2017, pp.1-12, 2017.

A. Charguéraud, The Locally Nameless Representation, J. Autom. Reasoning, vol.49, pp.363-408, 2012.

, Publication date, Bindings as Bounded Natural Functors, vol.3, p.31, 2019.

A. Chlipala, Parametric Higher-Order Abstract Syntax for Mechanized Semantics, International Conference on Functional Programming (ICFP), pp.143-156, 2008.

A. Church, A Formulation of the Simple Theory of Types, J. Symb. Log, vol.5, pp.56-68, 1940.

E. Copello, N. Szasz, and Á. Tasistro, Formalisation in Constructive Type Theory of Barendregt's Variable Convention for Generic Structures with Binders, Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP) 2018, vol.274, pp.11-26, 2018.

N. G. De-bruijn, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem, Indag. Math, vol.75, pp.90034-90034, 1972.

J. Despeyroux, A. P. Felty, and A. Hirschowitz, Higher-Order Abstract Syntax in Coq, LNCS, vol.902, pp.124-138, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00074124

A. P. Felty and A. Momigliano, Hybrid: A Definitional Two-Level Approach to Reasoning with Higher-Order Abstract Syntax, J. Autom. Reasoning, vol.48, pp.43-105, 2012.

A. P. Felty, A. Momigliano, and B. Pientka, The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations: Part 2-a Survey, J. Autom. Reasoning, vol.55, pp.307-372, 2015.

A. P. Felty, A. Momigliano, and B. Pientka, An Open Challenge Problem Repository for Systems Supporting Binders, Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP) 2015, Iliano Cervesato and, vol.185, pp.18-32, 2015.

A. P. Felty and B. Pientka, Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison, Interactive Theorem Proving (ITP) 2010, vol.6172, pp.227-242, 2010.

F. Ferreira and B. Pientka, Programs Using Syntax with First-Class Binders, European Symposium on Programming (ESOP) 2017, Hongseok Yang, vol.10201, pp.504-529, 2017.

M. Fiore, N. Gambino, M. Hyland, and G. Winskel, The Cartesian Closed Bicategory of Generalised Species of Structures, J. London Math. Soc, vol.77, pp.203-220, 2008.

M. P. Fiore, G. D. Plotkin, and D. Turi, Abstract Syntax and Variable Binding, Logic in Computer Science (LICS) 1999. IEEE Computer Society, pp.193-202, 1999.
DOI : 10.1109/lics.1999.782615

D. Firsov and A. Stump, Generic Derivation of Induction for Impredicative Encodings in Cedille, Certified Programs and Proofs (CPP) 2018, pp.215-227, 2018.

M. Gabbay, A General Mathematics of Names. Inf. Comput, vol.205, pp.982-1011, 2007.

M. Gabbay and A. M. Pitts, A New Approach to Abstract Syntax Involving Binders, Logic in Computer Science (LICS) 1999. IEEE Computer Society, pp.214-224, 1999.

M. Gabbay and A. M. Pitts, A New Approach to Abstract Syntax with Variable Binding, Formal Asp. Comput, vol.13, pp.341-363, 2002.

N. Gambino and M. Hyland, Wellfounded Trees and Dependent Polynomial Functors, Types for Proofs and Programs (TYPES) 2003, Stefano Berardi, vol.3085, pp.210-225, 2003.
DOI : 10.1007/978-3-540-24849-1_14
URL : http://www.cs.le.ac.uk/people/ngambino/Publications/gambino-hyland.pdf

N. Ghani, P. Johann, and C. Fumex, Indexed Induction and Coinduction, Fibrationally. Logical Methods in Computer Science, vol.9, p.3, 2013.

N. Ghani, T. Uustalu, and M. Hamana, Explicit Substitutions and Higher-Order Syntax, Higher-Order and Symbolic Computation, vol.19, issue.3, pp.263-282, 2006.
DOI : 10.1145/976571.976580

L. Gheri and A. Popescu, A Formalized General Theory of Syntax with Bindings, Interactive Theorem Proving (ITP) 2017, vol.10499, pp.241-261, 2017.

, Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, 1993.

E. L. Gunter, C. J. Osborn, and A. Popescu, Theory Support for Weak Higher Order Abstract Syntax in Isabelle/HOL, Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP), vol.22, p.32, 2009.

J. C. Blanchette, L. Gheri, A. Popescu, and D. Traytel,

R. Harper, F. Honsell, and G. D. Plotkin, A Framework for Defining Logics, Logic in Computer Science (LICS) 1987. IEEE Computer Society, pp.194-204, 1987.

M. Hennessy and R. Milner, On Observing Nondeterminism and Concurrency, International Colloquium on Automata, Languages, and Programming (ICALP), vol.85, pp.299-309, 1980.

U. Hensel and B. Jacobs, Proof Principles for Datatypes with Iterated Recursion, Category Theory and Computer Science, vol.1290, pp.220-241, 1997.

A. Hirschowitz and M. Maggesi, Initial Semantics for Strengthened Signatures, Fixed Points in Computer Science, vol.77, pp.31-38, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00762649

M. Hofmann, Semantical Analysis of Higher-Order Abstract Syntax, Logic in Computer Science (LICS) 1999. IEEE Computer Society, pp.204-213, 1999.

F. Paul, . Hoogendijk, and . Oege-de-moor, Container Types Categorically, J. Funct. Program, vol.10, pp.191-225, 2000.

P. Gérard, B. Huet, and . Lang, Proving and Applying Program Transformations Expressed with Second-Order Patterns, Acta Inf, vol.11, pp.31-55, 1978.

F. Joachimski, Reduction Properties of ?IE-Systems, 2001.

P. T. Johnstone, Quotients of Decidable Objects in a Topos, Math. Proc. Cambridge Philosophical Society, vol.93, pp.409-419, 1983.

A. Joyal, Une théorie combinatoire des séries formelles, Adv. Math, vol.42, issue.81, pp.90052-90061, 1981.

A. Joyal, Foncteurs analytiques et espèces de structures, Combinatoire Énumérative. LNM, vol.1234, pp.126-159, 1986.

J. Kaiser, B. Pientka, and G. Smolka, Relating System F and ?2: A Case Study in Coq, Abella and Beluga, Formal Structures for Computation and Deduction (FSCD) 2017, Dale Miller, vol.84, pp.1-21, 2017.

H. and J. Keisler, Model Theory for Infinitary Logic: Logic with Countable Conjunctions and Finite Quantifiers. Studies in Logic and the Foundations of Mathematics, vol.62, 1971.

R. Kennaway, J. W. Klop, M. R. Sleep, and F. Vries, Infinitary Lambda Calculus. Theor. Comput. Sci, vol.175, pp.171-176, 1997.

S. Keuchel and J. Jeuring, Generic Conversions of Abstract Syntax Representations, Workshop on Generic Programming, pp.57-68, 2012.

S. Keuchel, S. Weirich, and T. Schrijvers, Needle & Knot: Binder Boilerplate Tied Up, European Symposium on Programming (ESOP) 2016, Peter Thiemann, vol.9632, pp.419-445, 2016.

J. Kock, Data Types with Symmetries and Polynomial Functors over Groupoids, Electr. Notes Theor. Comput. Sci, vol.286, pp.351-365, 2012.

O. Kun?ar and A. Popescu, Safety and Conservativity of Definitions in HOL and Isabelle/HOL, Principles of Programming Languages (POPL) (2018), vol.2, pp.1-24, 2018.

A. Kurz, D. Petrisan, P. Severi, and F. Vries, An Alpha-Corecursion Principle for the Infinitary Lambda Calculus, Coalgebraic Methods in Computer Science (CMCS) 2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01539877

, LNCS, vol.7399, pp.130-149

A. Kurz, D. Petrisan, P. Severi, and F. Vries, Nominal Coalgebraic Data Types with Applications to Lambda Calculus, Logical Methods in Computer Science, vol.9, p.4, 2013.

G. Lee, C. D. Bruno, S. Oliveira, K. Cho, and . Yi, GMeta: A Generic Formal Metatheory Framework for First-Order Representations, European Symposium on Programming (ESOP) 2012, Helmut Seidl, 2012.

, LNCS, vol.7211, pp.436-455

P. Lescanne and J. Rouyer-degli, Explicit Substitutions with de Bruijn's Levels, Rewriting Techniques and Applications (RTA) 1995, Jieh Hsiang, vol.914, pp.294-308, 1995.

R. Daniel, R. Licata, and . Harper, A Universe of Binding and Computation, International Conference on Functional Programming, pp.123-134, 2009.

M. Makkai and R. Paré, Accessible Categories: The Foundations of Categorical Model Theory, Contemporary Mathematics, vol.104, 1990.

R. Matthes and T. Uustalu, Substitution in Non-Wellfounded Syntax with Variable Binding, Theor. Comput. Sci, vol.327, pp.155-174, 2004.

, Bindings as Bounded Natural Functors, vol.22, p.33

C. Mcbride, Epigram: Practical Programming with Dependent Types, Advanced Functional Programming, vol.3622, pp.130-170, 2004.

R. Milner, A Theory of Type Polymorphism in Programming, J. Comput. Syst. Sci, vol.17, pp.348-375, 1978.

R. Milner, Communication and Concurrency, 1989.

R. Milner, Communicating and Mobile Systems: The ?-Calculus, 1999.

P. Morris, T. Altenkirch, and N. Ghani, A Universe of Strictly Positive Families, Int. J. Found. Comput. Sci, vol.20, pp.83-107, 2009.

B. Nordström, K. Petersson, and J. M. Smith, Programming in Martin-Löf's Type Theory: An Introduction, 1990.

M. Norrish, Recursive Function Definition for Types with Binders, Theorem Proving in Higher Order Logics (TPHOLs), vol.3223, pp.241-256, 2004.

C. Lawrence and . Paulson, The Foundation of a Generic Theorem Prover, J. Autom. Reasoning, vol.5, pp.363-397, 1989.

F. Pfenning and C. Elliott, Higher-Order Abstract Syntax, Programming Language Design and Implementation (PLDI) 1988, pp.199-208, 1988.

F. Pfenning and C. Schürmann, System Description: Twelf-A Meta-Logical Framework for Deductive Systems, Conference on Automated Deduction (CADE) 1999, Harald Ganzinger, vol.1632, pp.202-206, 1999.

B. Pientka, Beluga: Programming with Dependent Types, Contextual Data, and Contexts, Functional and Logic Programming (FLOPS) 2010, vol.6009, pp.1-12, 2010.

C. Benjamin and . Pierce, Types and Programming Languages, 2002.

A. Pitts, In Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Chapter The HOL Logic, pp.191-232, 1993.

A. M. Pitts, Nominal Logic, a First Order Theory of Names and Binding, Inf. Comput, vol.186, pp.165-193, 2003.

A. M. Pitts, Alpha-Structural Recursion and Induction, J. ACM, vol.53, pp.459-506, 2006.
DOI : 10.1007/11541868_2

A. Popescu, E. L. Gunter, and C. J. Osborn, Strong Normalization for System F by HOAS on Top of FOAS, Logic in Computer Science (LICS) 2010. IEEE Computer Society, pp.31-40, 2010.

A. Poswolsky and C. Schürmann, System Description: Delphin-A Functional Programming Language for Deductive Systems, Electr. Notes Theor. Comput. Sci, vol.228, pp.113-120, 2009.

F. Pottier, An Overview of C? ml, Electr. Notes Theor. Comput. Sci, vol.148, issue.2, pp.27-52, 2006.

J. M. Jan and . Rutten, Relators and Metric Bisimulations, Electr. Notes Theor. Comput. Sci, vol.11, pp.252-258, 1998.

S. Schäfer, T. Tebbi, and G. Smolka, Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions, Interactive Theorem Proving, vol.9236, pp.359-374, 2015.

C. Schürmann, J. Despeyroux, and F. Pfenning, Primitive Recursion for Higher-Order Abstract Syntax, Theor. Comput. Sci, vol.266, pp.418-425, 2001.

P. Sewell, F. Z. Nardelli, S. Owens, G. Peskine, T. Ridge et al., Ott: Effective Tool Support for the Working Semanticist, J. Funct. Program, vol.20, pp.71-122, 2010.

S. Staton, Name-Passing Process Calculi: Operational Models and Structural Operational Semantics, 2007.

D. Traytel, A. Popescu, and J. C. Blanchette, Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving, Logic in Computer Science (LICS) 2012. IEEE Computer Society, pp.596-605, 2012.

C. Urban and S. Berghofer, A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL, International Joint Conference on Automated Reasoning (IJCAR), 2006.

, LNCS, vol.4130, pp.498-512

C. Urban, S. Berghofer, and M. Norrish, Barendregt's Variable Convention in Rule Inductions, Conference on Automated Deduction (CADE) 2007, Frank Pfenning, vol.4603, p.34, 2007.

J. C. Blanchette, L. Gheri, A. Popescu, and D. Traytel,

/. Doi,

C. Urban and C. Kaliszyk, General Bindings and Alpha-Equivalence in Nominal Isabelle, Logical Methods in Computer Science, vol.8, issue.2, 2012.

C. Urban and C. Tasson, Nominal Techniques in Isabelle/HOL, Conference on Automated Deduction (CADE) 2005, Robert Nieuwenhuis, vol.3632, pp.38-53, 2005.

P. Hendrik-van-antwerpen, A. P. Neron, E. Tolmach, G. Visser, and . Wachsmuth, A Constraint Language for Static Semantic Analysis Based on Scope Graphs, Partial Evaluation and Program Manipulation (PEPM) 2016, pp.49-60, 2016.

S. Weirich, B. A. Yorgey, and T. Sheard, Binders Unbound, International Conference on Functional Programming (ICFP) 2011, pp.333-345, 2011.

B. Abraham and Y. , Combinatorial Species and Labelled Structures, 2014.