Author of the publication

Rewriting Modulo in Deduction Modulo.

. RTA, volume 2706 of Lecture Notes in Computer Science, page 395-409. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A type-based termination criterion for dependently-typed higher-order rewrite systems. CoRR, (2006)Inductive types in the Calculus of Algebraic Constructions. CoRR, (2006)Type Safety of Rewrite Rules in Dependent Types.. FSCD, volume 167 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Translating Proofs from an Impredicative Type System to a Predicative One., , and . CSL, volume 252 of LIPIcs, page 19:1-19:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Implementation of Construction Functions for Non-free Concrete Data Types., , and . ESOP, volume 4421 of Lecture Notes in Computer Science, page 95-109. Springer, (2007)Definitions by Rewriting in the Calculus of Constructions.. LICS, page 9-18. IEEE Computer Society, (2001)Computability Closure: Ten Years Later.. Rewriting, Computation and Proof, volume 4600 of Lecture Notes in Computer Science, page 68-88. Springer, (2007)A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems.. RTA, volume 3091 of Lecture Notes in Computer Science, page 24-39. Springer, (2004)Rewriting Modulo in Deduction Modulo.. RTA, volume 2706 of Lecture Notes in Computer Science, page 395-409. Springer, (2003)Rewriting modulo in Deduction modulo. CoRR, (2006)