Rewriting Modulo in Deduction Modulo-Reference-Cited by-同舟云学术

Rewriting Modulo in Deduction Modulo

Published:2003 Issue: Volume: Page:395-409
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Blanqui Frédéric

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44881-0_28

Reference25 articles.

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.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Computability Closure: Ten Years Later;Rewriting, Computation and Proof;2007

2. Higher-Order Termination: From Kruskal to Computability;Logic for Programming, Artificial Intelligence, and Reasoning;2006

3. Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems;Logic for Programming, Artificial Intelligence, and Reasoning;2006

4. Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations;Computer Science Logic;2005

5. A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems;Rewriting Techniques and Applications;2004