Rewriting modulo in deduction modulo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2706, Issue , 2003, Pages 395-409

  Blanqui, Frèdèric ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; EQUIVALENCE CLASSES; SYNTACTICS;

ASSOCIATIVITY; BETA-REDUCTION; CALCULUS OF ALGEBRAIC CONSTRUCTIONS; CALCULUS OF CONSTRUCTION; COMMUTATIVITY; DEDUCTION MODULO; REWRITE RULES; REWRITING MODULO;

CALCULATIONS;

EID: 33750692203     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_28     Document Type: Conference Paper

References (25)

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.
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”.
3. F. Blanqui. Definitions by rewriting in the Calculus of Constructions (extended abstract). In Proc. of LICS’01.
4. F. Blanqui. Definitions by rewriting in the Calculus of Constructions, 2002. Journal submission, 68 pages.
5. F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive-data-type Systems. Theoretical Computer Science, 272:41–68, 2002.
6. F. Blanqui. A short and flexible strong normalization proof for the Calculus of Algebraic Constructions with curried rewriting, 2003. Draft.
7. V. Breazu-Tannen and J. Gallier. Polymorphic rewriting conserves algebraic strong normalization. In Proc. of ICALP’89, LNCS 372.
8. E. Contejean, C. Marchè, B. Monate, and X. Urbain. CiME, 2000.
9. T. Coquand and G. Huet. The Calculus of Constructions. Information and Computation, 76(2–3):95–120, 1988.
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.
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.
12. D. Dougherty. Adding algebraic rewriting to the untyped lambda calculus. Information and Computation, 101(2):251–267, 1992.
13. G. Dowek, T. Hardin, and C. Kirchner. Theorem proving modulo. Technical Report 3400, INRIA Rocquencourt, France, 1998.
14. J.-Y. Girard, Y. Lafont and P. Taylor. Proofs and Types. Cambridge University Press, 1988.
15. G. Huet. Confluent reductions: Abstract properties and applications to termrewriting systems. Journal of the ACM, 27(4):797–821, 1980.
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.
17. J.-P. Jouannaud and A. Rubio. The Higher-Order Recursive Path Ordering. In Proc. of LICS’99.
18. J. W. Klop, V. van Oostrom, F. van Raamsdonk. Combinatory reduction systems: introduction and survey. Theoretical Computer Science, 121:279–308, 1993.
19. C. Marchè. Normalised rewriting and normalised completion. In Proc. of LICS’94.
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.
21. M. Rusinowitch. On termination of the direct sum of term-rewriting systems. Information Processing Letters, 26(2):65–70, 1987.
22. Coq Development Team. The Coq Proof Assistant Reference Manual – Version 7. 4. INRIA Rocquencourt, France, 2003. http://coq.inria.fr/.
23. Y. Toyama. Counterexamples to termination for the direct sum of term rewriting systems. Information Processing Letters, 25(3):141–143, 1987.
24. V. van Oostrom and F. van Raamsdonk. Weak orthogonality implies confluence: the higher-order case. In Proc. of LFCS’94, LNCS 813.
25. D. Walukiewicz-Chrzaszcz. Termination of rewriting in the Calculus of Constructions. Journal of Functional Programming, ?(?):?–?, 2002.