Two-Level Meta-reasoning in Coq-Reference-Cited by-同舟云学术

Two-Level Meta-reasoning in Coq

Published:2002 Issue: Volume: Page:198-213
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Felty Amy P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45685-6_14

Reference21 articles.

1. A.W. Appel and A.P. Felty. Lightweight lemmas in λProlog. In International Conference on Logic Programming, Nov. 1999.

2. A.W. Appel and A.P. Felty. A semantic model of types and machine instructions for proof-carrying code. In The 27th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2000.

3. P. Borras, D. Clément, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, and V. Pascual. Centaur: The system. In Proceedings of SIGSOFT’88: Third Annual Symposium on Software Development Environments (SDE3), Boston, 1988.

4. Lect Notes Comput Sci;J. Despeyroux,2000

5. Lect Notes Comput Sci;J. Despeyroux,1995

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

1. The Next 700 Challenge Problems for Reasoning with Higher-Order Abstract Syntax Representations;Journal of Automated Reasoning;2015-07-05

2. Hybrid;Journal of Automated Reasoning;2010-08-07

3. A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity;Electronic Notes in Theoretical Computer Science;2002-12

4. Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF;Lecture Notes in Computer Science

5. Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq;Lecture Notes in Computer Science