Inductive Types in the Calculus of Algebraic Constructions-Reference-Cited by-同舟云学术

Inductive Types in the Calculus of Algebraic Constructions

Published:2003 Issue: Volume: Page:46-59
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Blanqui Frédéric

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44904-3_4

Reference23 articles.

1. Technical Report;A. Abel,2002

2. F. Barbanera, M. Fernández, and H. Geuvers. Modularity of strong normalization and confluence in the algebraic-λ-cube. In Proceedings of the 9th IEEE Symposium on Logic in Computer Science, 1994.

3. 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.

4. F. Blanqui. Definitions by rewriting in the Calculus of Constructions (extended abstract). In Proceedings of the 16th IEEE Symposium on Logic in Computer Science, 2001.

5. 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”.

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

1. A Framework for Proof-carrying Logical Transformations;Electronic Proceedings in Theoretical Computer Science;2021-07-07

2. Recursive Functions with Higher Order Domains;Lecture Notes in Computer Science;2005

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

4. Towards Rewriting in Coq;Rewriting, Computation and Proof