, We prove by induction on ? that it is ?-well-formed. Hence, by Theorem 4.5.10, it is well-typed
, We have global_wf ? 0 = true, for all (u ? v) ? ?, rewrite_wf ? 0 (u ? v) and is_confluent ? = ext_true. By induction hypothesis, ? 0 is ?-well-formed. By soundness of rewrite_wf (Lemma 6.5.3), the rewrite rules in ? are weakly well-formed for ? 0 and are of Bibliography, 2014.
, MiniAgda: Integrating Sized and Dependent Types, Partiality And Recursion in Interative Theorem, 2010.
, Pure Type Systems with Judgemental Equality, Journal of Functional Programming, 2006.
, The Matita Interactive Theorem Prover, Automated Deduction (CADE), 23rd International Conference, Proceedings, 2011.
DOI : 10.1007/3-540-48256-3_12
, A Calculus of Constructions with Explicit Subtyping, Types for Proofs and Programs (TYPES '14), 20th International Conference, Post- Proceedings, 2015.
, Proving Confluence of Term Rewriting Systems Automatically, Rewriting Techniques and Applications (RTA) 20th International Conference, Proceedings, 2009.
DOI : 10.1006/jsco.1994.1003
, Introduction to Generalized Type Systems, Journal of Functional Programming, 1991.
, Adding Algebraic Rewriting to the Calculus of Constructions: Strong Normalization Preserved, Conditional and Typed Rewriting Systems (CTRS), 2nd International Workshop, Proceedings, 1990.
, Auto-validation d'un système de preuves avec familles inductives, 1999.
, CoqInE : Translating the calculus of inductive constructions into the ??-calculus modulo, Proof Exchange for Theorem Proving (PxTP), Second International Workshop, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01126128
, The lambda-Picalculus Modulo as a Universal Proof Language, Proof Exchange for Theorem Proving (PxTP), Second International Workshop, Proceedings, 2012.
, Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs, Logic for Programming , Artificial Intelligence, and Reasoning (LPAR), 14th International Conference, Proceedings, 2007.
DOI : 10.1007/978-3-540-75560-9_13
URL : https://hal.archives-ouvertes.fr/inria-00315920
, A Brief Overview of Agda ??? A Functional Language with Dependent Types, Theorem Proving in Higher Order Logics (TPHOLs), 22nd International Conference, Proceedings, 2009.
DOI : 10.1007/978-3-540-87827-8_28
, Combining First and Higher Order Rewrite Systems with Type Assignment Systems, Typed Lambda Calculi and Applications (TLCA), International Conference, Proceedings, 1993.
, Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega, Automata , Languages and Programming (ICALP), 20nd International Colloquium , Proceedings, 1993.
, Modularity of Strong Normalization and Confluence in the Algebraic-lambda-Cube, Logic in Computer Science (LICS), Ninth Annual Symposium, Proceedings, 1994.
, Modular properties of algebraic type systems, Higher-Order Algebra, Logic, and Term Rewriting (HOA), Second International Workshop, 1995.
DOI : 10.1007/3-540-61254-8_18
, The Calculus of Algebraic Constructions, Rewriting Techniques and Applications (RTA), 10th International Conference, Proceedings, 1999.
DOI : 10.1007/3-540-48685-2_25
URL : https://hal.archives-ouvertes.fr/inria-00105545
, A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems, Rewriting Techniques and Applications (RTA), 15th International Conference, Proceedings, 2004.
, Definitions by rewriting in the Calculus of Constructions, Mathematical Structures in Computer Science, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00105648
, Inductive Types in the Calculus of Algebraic Constructions, Fundamenta Informaticae, 2005.
DOI : 10.1007/3-540-44904-3_4
URL : https://hal.archives-ouvertes.fr/inria-00105655
, Termination of rewrite relations on lambda-terms based on Girard's notion of reducibility, Theoretical Computer Science, 2015.
, Inductive Families Need Not Store Their Indices, Types for Proofs and Programs (TYPES), International Workshop, Revised Selected Papers, 2003.
DOI : 10.1007/978-3-540-24849-1_8
, Conception d'un noyau de vérification de preuves pour le lambda-Pi-calcul modulo, 2011.
, An inverse of the evaluation functional for typed lambda -calculus, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 1991.
DOI : 10.1109/LICS.1991.151645
, A Shallow Embedding of Resolution and Superposition Proofs into the ??-Calculus Modulo, Proof Exchange for Theorem Proving (PxTP '13), Third International Workshop, 2013.
, Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo, Typed Lambda Calculi and Applications (TLCA) 8th International Conference, Proceedings, 2007.
DOI : 10.1007/978-3-540-73228-0_9
, Objects and Subtyping in the ??-Calculus Modulo, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01126394
, Combinatory Logic, Volume I, 1958.
, The confluence of ground term rewrite systems is decidable in polynomial time, Proceedings 2001 IEEE International Conference on Cluster Computing, 2001.
DOI : 10.1109/SFCS.2001.959904
, The calculus of constructions, Information and Computation, vol.76, issue.2-3, 1988.
DOI : 10.1016/0890-5401(88)90005-3
URL : https://hal.archives-ouvertes.fr/inria-00076024
, Compiling Logics, Recent Trends in Algebraic Development Techniques (WADT), 21st International Workshop, Revised Selected Papers, 2012.
, Some properties of conversion. Transactions of the, 1936.
, Zenon Modulo: When Achilles Outruns the Tortoise using Deduction Modulo, Logic for Programming Artificial Intelligence and Reasoning (LPAR), 2013.
, Theorem Proving Modulo, Journal of Automated Reasoning, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01199506
, Proving termination with multiset orderings, Communications of the ACM, vol.22, issue.8, 1979.
DOI : 10.1145/359138.359142
, Equivalence de Curry-Howard entre le lambda-Pi calcul et la logique intuitionniste, Internship Report, 2011.
, Adding algebraic rewriting to the untyped lambda calculus, Information and Computation, vol.101, issue.2, 1992.
DOI : 10.1016/0890-5401(92)90064-M
, Higher-Order Unification and Matching, Handbook of Automated Reasoning (in 2 volumes, 2001.
, Models and termination of proof-reduction in the lambda-Picalculus modulo theory, 2015.
, Arithmetic as a Theory Modulo, Term Rewriting and Applications (RTA), 16th International Conference, Proceedings, 2005.
DOI : 10.1007/978-3-540-32033-3_31
, Untersuchungen über das logische schließen. i, Mathematische Zeitschrift, 1935.
, The Church-Rosser Property for beta-eta-reduction in Typed lambda-Calculi, Logic in Computer Science (LICS), Seventh Annual Symposium, Proceedings, 1992.
, HOL Light: An Overview, Theorem Proving in Higher Order Logics (TPHOLs), 22nd International Conference, Proceedings, 2009.
, A framework for defining logics, Journal of the ACM, vol.40, issue.1, 1993.
DOI : 10.1145/138027.138060
, FoCaLiZe Reference Manual
, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM, 1980.
, The OpenTheory Standard Theory Library, NASA Formal Methods (NFM), Third International Symposium, Proceedings, 2011.
, A computation model for executable higher-order algebraic specification languages, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 1991.
DOI : 10.1109/LICS.1991.151659
, The higher-order recursive path ordering, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782635
, Simple Word Problems in Universal Algebras, Automation of Reasoning, 1983.
DOI : 10.1007/978-3-642-81955-1_23
, Combinatory reduction systems, 1980.
, iProver -An Instantiation-Based Theorem Prover for First- Order Logic (System Description), Automated Reasoning (IJCAR), 4th International Joint Conference, Proceedings, 2008.
, The Nuprl Proof Development System, Version 5: Reference Manual and User's Guide
, Compiling pattern matching to good decision trees, Proceedings of the 2008 ACM SIGPLAN workshop on ML, ML '08, 2008.
DOI : 10.1145/1411304.1411311
, Simple Examples of Undecidable Associative Calculi, Doklady Mathematics, 1967.
, A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification, Journal of Logic and Computation, 1991.
, Confluence of the Lambda Calculus with Left-Linear Algebraic Rewriting, Information Processing Letters, 1992.
, On Theories with a Combinatorial Definition, Annals of Mathematics, 1942.
, Higher-Order Critical Pairs, Logic in Computer Science (LICS), Sixth Annual Symposium, Proceedings, 1991.
, Contextual modal type theory, ACM Transactions on Computational Logic, vol.9, issue.3, 2008.
DOI : 10.1145/1352582.1352591
, Martin-Löf 's Type Theory, 1990.
, Isabelle/HOL: A Proof Assistant for Higher-order Logic, 2002.
DOI : 10.1007/3-540-45949-9
, Strong Normalizability for the Combined System of the Typed lambda Calculus and an Arbitrary Convergent Term Rewrite System, Symbolic and Algebraic Computation (ISSAC), International Symposium, Proceedings, 1989.
, PVS: A prototype verification system, Automated Deduction (CADE, 1992.
DOI : 10.1007/3-540-55602-8_217
, Higher-order abstract syntax, In ACM SIGPLAN Notices, 1988.
, A type-theoretic foundation for programming with higherorder abstract syntax and first-class substitutions, Principles of Programming Languages (POPL), 2008.
, Beluga: Programming with Dependent Types, Contextual Data, and Contexts, Functional and Logic Programming, 2010.
, System Description: Twelf -a Metalogical Framework for Deductive Systems, Automated Deduction (CADE, 1999.
, Tree-Manipulating Systems and Church-Rosser Theorems, Journal of the ACM, 1973.
, Pure Type System conversion is always typable, Journal of Functional Programming, vol.1, issue.02, 2012.
DOI : 10.1017/S0956796805005770
URL : https://hal.archives-ouvertes.fr/inria-00497177
, Combining Algebra and Higher-Order Types, Logic in Computer Science (LICS), Third Annual Symposium, Proceedings, 1988.
, Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence, Automata, Languages and Programming (ICALP), 16th International Colloquium, Proceedings, 1989.
, On the Church-Rosser Property for the Direct Sum of Term Rewriting Systems, Journal of the ACM, 1987.
, Development closed critical pairs, Higher-Order Algebra , Logic, and Term Rewriting (HOA), Second International Workshop, 1995.
DOI : 10.1007/3-540-61254-8_26
, Termination of rewriting in the Calculus of Constructions, Journal of Functional Programming, 2003.