Rewriting Modulo in Deduction Modulo

  • Frédéric Blanqui
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2706)


We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In a previous work, we defined general syntactic conditions based on the notion of computability closure for ensuring the termination of the combination of rewriting and β-reduction.

Here, we show that this result is preserved when considering rewriting modulo a set of equations if the equivalence classes generated by these equations are finite, the equations are linear and satisfy general syntactic conditions also based on the notion of computability closure. This includes equations like associativity and commutativity and provides an original treatment of termination modulo equations.


Induction Hypothesis Transitive Closure Predicate Symbol Critical Pair Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.Google Scholar
  2. 2.
    F. Blanqui. Théorie des Types et Récriture. PhD thesis, Université Paris XI, Orsay, France, 2001. Available in english as “Type Theory and Rewriting”.Google Scholar
  3. 3.
    F. Blanqui. Definitions by rewriting in the Calculus of Constructions (extended abstract). In Proc. of LICS’01.Google Scholar
  4. 4.
    F. Blanqui. Definitions by rewriting in the Calculus of Constructions, 2002. Journal submission, 68 pages.Google Scholar
  5. 5.
    F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive-data-type Systems. Theoretical Computer Science, 272:41–68, 2002.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    F. Blanqui. A short and flexible strong normalization proof for the Calculus of Algebraic Constructions with curried rewriting, 2003. Draft.Google Scholar
  7. 7.
    V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalization. In Proc. of ICALP’89, LNCS 372.Google Scholar
  8. 8.
    E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME, 2000.Google Scholar
  9. 9.
    T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2–3):95–120, 1988.CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    T. Coquand. An algorithm for testing conversion in type theory. In G. Huet, G. Plotkin, editors, Logical Frameworks, p. 255–279. Cambridge Univ. Press, 1991.Google Scholar
  11. 11.
    N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chap. 6. North-Holland, 1990.Google Scholar
  12. 12.
    D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101(2):251–267, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Technical Report 3400, INRIA Rocquencourt, France, 1998.Google Scholar
  14. 14.
    J.-Y. Girard, Y. Lafont and P. Taylor. Proofs and Types. Cambridge University Press, 1988.Google Scholar
  15. 15.
    G. Huet. Confluent reductions: Abstract properties and applications to term-rewriting systems. Journal of the ACM, 27(4):797–821, 1980.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM Journal on Computing, 15(4):1155–1194, 1986.zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    J.-P. Jouannaud and A. Rubio. The Higher-Order Recursive Path Ordering. In Proc. of LICS’99.Google Scholar
  18. 18.
    J. W. Klop, V. van Oostrom, F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279–308, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    C. Marché. Normalised rewriting and normalised completion. In Proc. of LICS’94.Google Scholar
  20. 20.
    M. Okada. Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system. In Proc. of ISSAC’89.Google Scholar
  21. 21.
    M. Rusinowitch. On termination of the direct sum of term-rewriting systems. Information Processing Letters, 26(2):65–70, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Coq Development Team. The Coq Proof Assistant Reference Manual — Version 7.4. INRIA Rocquencourt, France, 2003. Scholar
  23. 23.
    Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25(3):141–143, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    V. van Oostrom and F. van Raamsdonk. Weak orthogonality implies confluence: the higher-order case. In Proc. of LFCS’94, LNCS 813.Google Scholar
  25. 25.
    D. Walukiewicz-Chrząszcz. Termination of rewriting in the Calculus of Constructions. Journal of Functional Programming, ?(?):?-?, 2002.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Frédéric Blanqui
    • 1
  1. 1.Laboratoire d’Informatique de l’École PolytechniquePalaiseau CedexFrance

Personalised recommendations