P. Aczel, An Introduction to Inductive Definitions, Handbook of Mathematical Logic, pp.739-782, 1977.
DOI : 10.1016/S0049-237X(08)71120-0

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

G. Barthe and S. Stratulat, Validation of the JavaCard Platform with Implicit Induction Techniques, RTA (Rewriting Techniques and Applications), pp.337-351, 2003.
DOI : 10.1007/3-540-44881-0_24

A. Bouhoula and M. Rusinowitch, Implicit induction in conditional theories, Journal of Automated Reasoning, vol.31, issue.2, pp.189-235, 1995.
DOI : 10.1007/BF00881856
URL : https://hal.archives-ouvertes.fr/inria-00074627

F. Bronsard, U. S. Reddy, and R. Hasker, Induction using term orderings, CADE (Conf. on Automated Deduction), pp.102-117, 1994.
DOI : 10.1007/3-540-58156-1_8

J. Brotherston, Cyclic Proofs for First-Order Logic with Inductive Definitions, Proceedings of TABLEAUX-14, pp.78-92, 2005.
DOI : 10.1007/11554554_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.1178

J. Brotherston, Sequent Calculus Proof Systems for Inductive Definitions, 2006.

J. Brotherston, N. Gorogiannis, and R. L. Petersen, A Generic Cyclic Theorem Prover, APLAS-10 (10th Asian Symposium on Programming Languages and Systems), pp.350-367, 2012.
DOI : 10.1007/978-3-642-35182-2_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.570.7975

J. Brotherston and A. Simpson, Sequent calculi for induction and infinite descent, Journal of Logic and Computation, vol.21, issue.6, pp.1177-1216, 2011.
DOI : 10.1093/logcom/exq052

G. Gentzen, Untersuchungen ???ber das logische Schlie???en. I, Mathematische Zeitschrift, vol.39, issue.1, pp.176-210, 1935.
DOI : 10.1007/BF01201353

O. Kupferman and M. Vardi, Weak alternating automata are not that weak, ACM Transactions on Computational Logic, vol.2, issue.3, pp.408-429, 2001.
DOI : 10.1145/377978.377993
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.961

M. Michel, Complementation is more difficult with automata on infinite words, 1988.

S. Negri and J. V. Plato, Structural Proof Theory, 2001.
DOI : 10.1017/CBO9780511527340
URL : https://hal.archives-ouvertes.fr/hal-01251230

M. Rusinowitch, S. Stratulat, and F. Klay, Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm, Journal of Automated Reasoning, vol.30, issue.2, pp.53-177, 2003.
DOI : 10.1007/10722167_27
URL : https://hal.archives-ouvertes.fr/inria-00099167

S. Stratulat, A unified view of induction reasoning for first-order logic Turing-100 (The Alan Turing Centenary Conference, EPiC Series, vol.10, pp.326-352, 2012.

S. Stratulat, Structural vs. Cyclic Induction: A Report on Some Experiments with Coq, 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp.27-34, 2016.
DOI : 10.1109/SYNASC.2016.018
URL : https://hal.archives-ouvertes.fr/hal-01590647

S. Stratulat, Mechanically certifying formula-based Noetherian induction reasoning, Journal of Symbolic Computation, vol.80, issue.1, pp.209-249, 2017.
DOI : 10.1016/j.jsc.2016.07.014
URL : https://hal.archives-ouvertes.fr/hal-01590649

R. Tarjan, Depth-First Search and Linear Graph Algorithms, SIAM Journal on Computing, vol.1, issue.2, pp.146-160, 1972.
DOI : 10.1137/0201010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.327.8418

C. Wirth, Descente Infinie + Deduction, Logic Journal of IGPL, vol.12, issue.1, pp.1-96, 2004.
DOI : 10.1093/jigpal/12.1.1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.619