S. D. Module and . Sig, ASignature.mkSignature ar beq_symb_ok Definition Fs : list Sig := M.zero::M.succ::M.quot::M.minus::nil. Lemma Fs_ok : forall f : Sig, In f Fs. Proof. list_ok. Qed. Definition some_symbol : Sig := M.minus

S. @fun, Sig M.minus (Vcons (@Var S1

P. Module, . Definition-sig:-=-s1, and . Sig, Definition trsInt (f : S1.Sig) := match f as f return poly (@ASignature.arity sig f) with | M, => (0%Z, Vnil) :: nil | ... end

T. Altenkirch, Constructions, Inductive Types and Strong Normalization, 1993.

T. Arts and J. Giesl, Termination of term rewriting using dependency pairs, Theoretical Computer Science, vol.236, issue.1-2, pp.133-178, 2000.
DOI : 10.1016/S0304-3975(99)00207-8

A. Balaa and Y. Bertot, Fix-Point Equations for Well-Founded Recursion in Type Theory, Proc. of TPHOL'00
DOI : 10.1007/3-540-44659-1_1

F. Barbanera, M. Fernández, and H. Geuvers, Modularity of strong normalization in the algebraic-??-cube, Journal of Functional Programming, vol.7, issue.6, pp.613-660, 1997.
DOI : 10.1017/S095679689700289X

H. Barendregt, Lambda Calculi with types, Handbook of logic in computer science, 1992.
DOI : 10.1017/cbo9781139032636

G. Barthe, J. Forest, and D. Pichardie, Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant, Proc. of FLOPS'06
DOI : 10.1007/11737414_9
URL : https://hal.archives-ouvertes.fr/inria-00564237

S. Berghofer and T. Nipkow, Executing Higher Order Logic, Proc. of TYPES'02
DOI : 10.1007/3-540-45842-5_2

Y. Bertot and P. Castéran, Coq'Art: The Calculus of Inductive Constructions. EATCS Texts in Theoretical Computer Science, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00344237

F. Blanqui, Higher-order dependency pairs, Proc. of WST'06
URL : https://hal.archives-ouvertes.fr/inria-00084821

F. Blanqui, Definitions by rewriting in the Calculus of Constructions, MSCS, vol.15, issue.1, pp.37-92, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00105648

F. Blanqui, Computability Closure: Ten Years Later. Rewriting, Computation and Proof ? Essays Dedicated to J.-P. Jouannaud on the Occasion of His 60th Birthday, LNCS, vol.4600, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00161092

F. Blanqui and A. Koprowski, Automated verification of termination certificates, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00763495

F. Blanqui, S. Coupet-grimal, W. Delobel, S. Hinderer, and A. Koprowski, CoLoR: a Coq Library on Rewriting and termination, Proc. of WST'06
URL : https://hal.archives-ouvertes.fr/inria-00084835

F. Blanqui, J. Jouannaud, and P. Strub, From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures
DOI : 10.1007/978-0-387-09680-3_24
URL : https://hal.archives-ouvertes.fr/inria-00275382

M. Boespflug, P. Borovanský, H. Cirstea, H. Dubois, C. Kirchner et al., Dedukti version 1.1.3, 2000.

T. Braibant and D. Pous, An Efficient Coq Tactic for Deciding Kleene Algebras, Proc. of ITP'10
DOI : 10.1007/978-3-642-14052-5_13

S. Briais, Theory and Tool Support for the Formal Verification of Cryptographic Protocols, 2008.

L. Bulwahn, A. Krauss, and T. Nipkow, Finding Lexicographic Orders for Termination Proofs in Isabelle Certification Problem Format. 2010. Certification Problem Format, Proc. of TPHOL'07

A. Chlipala, Modular Development of Certified Program Verifiers with a Proof Assistant, Proc. of ICFP'06

J. Chrz?szcz, Implementation of Modules in the Coq System, Proc. of TPHOL'03

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., Maude Manual (Version 2.2), 2005.

E. Contejean, Modelling permutations in Coq for Coccinelle. Rewriting, Computation and Proof ? Essays Dedicated to J.-P. Jouannaud for His 60th Birthday, LNCS, vol.4600, 2007.

E. Contejean, P. Courtieu, J. Forest, and O. Pons, Certification of Automated Termination Proofs, Proc. of FROCOS'07
DOI : 10.1007/978-3-540-74621-8_10
URL : https://hal.archives-ouvertes.fr/hal-01125312

E. Contejean, C. Marché, A. P. Tomás, and X. Urbain, Mechanically Proving Termination Using Polynomial Interpretations, Journal of Automated Reasoning, vol.12, issue.1, pp.325-363, 2005.
DOI : 10.1007/s10817-005-9022-x
URL : https://hal.archives-ouvertes.fr/inria-00001167

T. Coquand, Pattern Matching with Dependent Types, Proc. of TYPES'92

T. Coquand and C. Paulin-mohring, Inductively defined types, Proc. of COLOG'88
DOI : 10.1007/3-540-52335-9_47

S. Coupet-grimal and W. Delobel, An effective proof of the well-foundedness of the multiset path ordering, Applicable Algebra in Engineering, Communication and Computing, vol.43, issue.2, pp.453-469, 2006.
DOI : 10.1007/s00200-006-0020-y

P. Courtieu, J. Forest, and X. Urbain, Certifying a Termination Criterion Based on Graphs, without Graphs, Proc. of TPHOL'08
DOI : 10.1007/10704567_3
URL : https://hal.archives-ouvertes.fr/hal-01125530

D. Delahaye, A Tactic Language for the System Coq, Proc. of LPAR'00, 1955.
DOI : 10.1007/3-540-44404-1_7
URL : https://hal.archives-ouvertes.fr/hal-01125070

N. Dershowitz, Termination by Abstraction, Proc. of ICLP'04
DOI : 10.1007/978-3-540-27775-0_1

N. Dershowitz, Orderings for term-rewriting systems, Theoretical Computer Science, vol.17, issue.3, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3

N. Dershowitz and J. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, 1990.
DOI : 10.1016/B978-0-444-88074-1.50011-1

G. Dowek and B. Werner, Abstract, The Journal of Symbolic Logic, vol.87, issue.04, pp.1289-1316, 2003.
DOI : 10.1007/BFb0037116

G. Dowek, T. Hardin, and C. Kirchner, Theorem proving modulo, Journal of Automated Reasoning, vol.31, issue.1, pp.33-72, 2003.
DOI : 10.1023/A:1027357912519
URL : https://hal.archives-ouvertes.fr/hal-01199506

J. Giesl, P. Schneider-kamp, and R. Thiemann, AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework, Proc. of IJCAR'06
DOI : 10.1007/11814771_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.2217

J. Giesl, S. Swiderski, P. Schneider-kamp, and R. Thiemann, Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages, RTA'06
DOI : 10.1007/11805618_23

J. Giesl, R. Thiemann, P. Schneider-kamp, and S. Falke, Improving Dependency Pairs, Proc. of LPAR'03
DOI : 10.1007/978-3-540-39813-4_11

J. Giesl, T. Arts, and E. Ohlebusch, Modular Termination Proofs for Rewriting Using Dependency Pairs, Journal of Symbolic Computation, vol.34, issue.1, pp.21-58, 2002.
DOI : 10.1006/jsco.2002.0541

J. Giesl, R. Thiemann, P. Schneider-kamp, and S. Falke, Mechanizing and Improving Dependency Pairs, Journal of Automated Reasoning, vol.34, issue.2, pp.155-203, 2006.
DOI : 10.1007/s10817-006-9057-7

E. Giménez, Codifying Guarded Definitions with Recursion Schemes, TYPES'94

J. Girard, Y. Lafont, and P. Taylor, Proofs and Types, 1988.

G. Gonthier and A. Mahboubi, A Small Scale Reflection extension for the Coq system, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00258384

B. Grégoire and X. Leroy, A compiled implementation of strong reduction, Proc. of ICFP'02

F. Haftmann and T. Nipkow, Code Generation via Higher-Order Rewrite Systems, Proc. of FLOPS'10
DOI : 10.1007/978-3-642-12251-4_9

S. Hinderer, Certification des preuves de terminaison par interprétations polynomiales, 2004.

N. Hirokawa and A. Middeldorp, Automating the Dependency Pair Method, IC, vol.199, issue.12, pp.172-199, 2005.

N. Hirokawa and A. Middeldorp, Tyrolean termination tool: Techniques and features, Information and Computation, vol.205, issue.4, pp.474-511, 2007.
DOI : 10.1016/j.ic.2006.08.010

N. Hirokawa and G. Moser, Automated Complexity Analysis Based on the Dependency Pair Method, Proc. of IJCAR'08
DOI : 10.1007/978-3-540-71070-7_32

C. Hur, Heq: A Coq library for Heterogeneous Equality, 2009.

J. Jouannaud, A. Rubio, D. Knuth, and P. Bendix, The Higher-Order Recursive Path Ordering Simple word problems in universal algebra. Computational problems in abstract algebra, Proc. of LICS'99, 1967.

A. Koprowski, Certified Higher-Order Recursive Path Ordering, Proc. of RTA'06
DOI : 10.1007/11805618_17

A. Koprowski, Termination of rewriting and its certification, 2008.

A. Koprowski, Coq formalization of the higher-order recursive path ordering, Applicable Algebra in Engineering, Communication and Computing, vol.32, issue.2, pp.5-6, 2009.
DOI : 10.1007/s00200-009-0105-5

A. Koprowski and H. Zantema, Certification of Proving Termination of Term Rewriting by Matrix Interpretations, Proc. of SOFSEM'08
DOI : 10.1007/978-3-540-77566-9_28

M. Korp, C. Sternagel, H. Zankl, and A. Middeldorp, Tyrolean Termination Tool 2, Proc. of RTA'09
DOI : 10.1007/978-3-540-70590-1_23

A. Krauss, Certified Size-Change Termination, Proc. of CADE'07
DOI : 10.1007/978-3-540-73595-3_34

K. Kusakari, M. Nakamura, and Y. Toyama, Argument Filtering Transformation, Proc. of PPDP'99
DOI : 10.1007/10704567_3

D. Lankford, On Proving term rewriting systems are Noetherian, 1979.

X. Leroy, D. Doligez, A. Frisch, J. Garrigue, D. Rémy et al., The Objective Caml system release 3.12, Documentation and user's manual, 2010.

P. Letouzey, A New Extraction for Coq, Proc. of TYPES'02
DOI : 10.1007/3-540-39185-1_12
URL : https://hal.archives-ouvertes.fr/hal-00150914

Z. Manna and S. Ness, On the termination of Markov algorithms, Proc. of HICSS'70

J. Marion, Analysing the implicit complexity of programs, Information and Computation, vol.183, issue.1, pp.2-18, 2003.
DOI : 10.1016/S0890-5401(03)00011-7
URL : https://hal.archives-ouvertes.fr/inria-00099505

C. Mcbride, Dependently typed functional programs and their proofs, 1999.

M. T. Nguyen, J. Giesl, P. Schneider-kamp, D. Schreye, and . De, Termination Analysis of Logic Programs Based on Dependency Graphs, Proc. of LOPSTR'07
DOI : 10.1007/s00200-005-0179-7

C. Paulin-mohring, Extracting F?'s Programs from Proofs in the Calculus of Constructions, Proc. of POPL'89

C. Paulin-mohring, Inductive definitions in the system Coq rules and properties, Proc. of TLCA'93
DOI : 10.1007/BFb0037116

S. Peyton-jones, Haskell 98 Language and Libraries, The revised report, 2003.

A. Saïbi, Typing algorithm in type theory with inheritance, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '97
DOI : 10.1145/263699.263742

P. Schneider-kamp, R. Thiemann, E. Annov, M. Codish, and J. Giesl, Proving Termination Using Recursive Path Orders and SAT Solving, Proc. of FROCOS'07
DOI : 10.1007/978-3-540-74621-8_18

P. Schneider-kamp, J. Giesl, A. Serebrenik, and R. Thiemann, Automated termination proofs for logic programs by term rewriting, ACM Transactions on Computational Logic, vol.11, issue.1, pp.1-52, 2009.
DOI : 10.1145/1614431.1614433

M. Sozeau, First-Class Type Classes, Proc. of TPHOL'08
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864

M. Sozeau, PROGRAM-ing Finger trees in Coq, Proc. of ICFP'07

C. Sternagel and A. Middeldorp, Root-Labeling, Proc. of RTA'08
DOI : 10.1007/978-3-540-70590-1_23

C. Sternagel and R. Thiemann, Certification of Termination Proofs using CeTA, Proc. of TPHOL'09

C. Sternagel and R. Thiemann, Certified Subterm Criterion and Certified Usable Rules, Proc. of RTA'10

T. Streicher, Investigations into Intensional Type Theory, 1993.

P. Strub, Coq Modulo Theory, Proc. of CSL'10
DOI : 10.1007/978-3-642-15205-4_40
URL : https://hal.archives-ouvertes.fr/inria-00497404

P. Strub, Coq modulo theories Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science Termination Portal. http://termination-portal.org/ Termination Problem Data Base (TPDB) http://termination-portal.org/wiki/TPDB Waldmann, Proc. of WST'09 Consistency and completeness of rewriting in the Calculus of Constructions, pp.1-20, 2003.

B. Werner, Une Théorie des Constructions Inductives, 1994.

H. Zantema, Termination of Term Rewriting by Semantic Labelling, Fundamenta Informaticae, vol.24, pp.89-105, 1995.