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

. Bachmair, . Dershowitz, L. Bachmair, and N. Dershowitz, Commutation, transformation, and termination, Proceedings of the Eighth International Conference on Automated Deduction, pp.5-20, 1986.
DOI : 10.1007/3-540-16780-3_76

H. P. Barendregt and D. Chemouil, The Lambda Calculus -Its Syntax and Semantics. North-Holland Isomorphisms of simple inductive types through extensional rewriting, Amsterdam. Mathematical Structures in Computer Science, vol.15, issue.5, pp.875-915, 1984.

D. Chemouil and S. Soloviev, Remarks on Isomorphisms of Simple Inductive Types, Electronic Notes in Theoretical Computer Science, vol.85, issue.7, 2003.
DOI : 10.1016/S1571-0661(04)80760-6
URL : https://hal.archives-ouvertes.fr/hal-00783654

[. Cosmo and R. , Review of Isomorphisms of Types:, Progress in Theoretical Computer Science. Birkhäuser, 1995.
DOI : 10.1145/270563.571468

[. Cosmo and R. , A brief history of rewriting with extensionality, International Summer School on Type Theory and Rewriting. Slides, 1996.

[. Cosmo and R. , On the power of simple diagrams, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA-96), volume 1103 of LNCS, pp.200-214, 1996.
DOI : 10.1007/3-540-61464-8_53

C. Di, K. Cosmo, R. Kesner, and D. , Simulating expansions without expansions, 1993.
URL : https://hal.archives-ouvertes.fr/inria-00074762

C. Di, D. Kesner, R. Cosmo, and D. Kesner, Combining algebraic rewriting, extensional lambda calculi, and fixpoints, Theoretical Computer Science, vol.169, issue.2, pp.201-220, 1996.

C. Di, D. Kesner, R. Cosmo, and D. Kesner, Rewriting with extensional polymorphic lambda-calculus, Lecture Notes in Computer Science, 1092.

V. Doornbos, H. Karger-]-doornbos, and B. Von-karger, On the union of well-founded relations, Logic Journal of IGPL, vol.6, issue.2, pp.195-201, 1998.
DOI : 10.1093/jigpal/6.2.195

S. Flegontov, A. Flegontov, S. Soloviev, A. Geser, and . Girard, Type theory in differential equations Relative Termination Proofs and Types. Cambridge Tracts in Theoretical Computer Science 7, VIII International Workshop on Advanced Computing and Analysis Techniques in Physics Research (ACA'02), 1988.

S. Lengrand, Induction principles as the foundation of the theory of normalisation: Concepts and techniques, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00004358

R. Matthes, Lambda calculus : A case for inductive definitions. Lecture notes for ESSLLI', European Summer School in Logic, 2000.

S. Soloviev and D. Chemouil, Some Algebraic Structures in Lambda-Calculus with Inductive Types, Proc. TYPES'03, 2004.
DOI : 10.1007/978-3-540-24849-1_22
URL : https://hal.archives-ouvertes.fr/hal-00782718