On the Role of Type Decorations in the Calculus of Inductive Constructions-Reference-Cited by-同舟云学术

On the Role of Type Decorations in the Calculus of Inductive Constructions

Published:2005 Issue: Volume: Page:151-166
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Barras Bruno,Grégoire Benjamin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11538363_12.pdf

Reference17 articles.

1. Aspinall, D., Compagnoni, A.: Subtyping dependent types. Theor. Comput. Sci. 266(1-2), 273–309 (2001)

2. Barendregt, H.: Lambda calculi with types. In: Abramsky, Gabbay, Maibaum (eds.) Handbook of Logic in Computer Science, vol. 2, Clarendon, Oxford (1992)

3. Barras, B.: Auto-validation d’un système de preuves avec familles inductives. PhD thesis, Université Paris 7 (1999)

4. Barthe, G., Coquand, T.: On the equational theory of non-normalizing pure type systems. Journal of Functional Programming 14(2), 191–209 (2004)

5. Barthe, G., Sørensen, M.: Domain-free pure type systems. Journal of Functional Programming 10(5), 412–452 (2000)

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

1. Extracting functional programs from Coq, in Coq;Journal of Functional Programming;2022

2. Extracting smart contracts tested and verified in Coq;Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs;2021-01-17

3. Full Reduction at Full Throttle;Certified Programs and Proofs;2011

4. Extending Coq with Imperative Features and Its Application to SAT Verification;Interactive Theorem Proving;2010

5. Consistency and Completeness of Rewriting in the Calculus of Constructions;Logical Methods in Computer Science;2008-09-15