Two-level meta-reasoning in coq

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2410, Issue , 2002, Pages 198-213

  Felty, Amy P ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTER CIRCUITS; FORMAL LOGIC; SPECIFICATIONS; SYNTACTICS;

CALCULUS OF INDUCTIVE CONSTRUCTIONS; HIGHER-ORDER ABSTRACT SYNTAX; INDUCTIVE DEFINITIONS; LOGICAL FRAMEWORKS; MODULAR SPECIFICATIONS; SPECIFICATION LOGIC; STRUCTURAL INDUCTION; TWO-LEVEL APPROACH;

THEOREM PROVING;

EID: 84945283693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45685-6_14     Document Type: Conference Paper

References (21)

1. A.W. Appel and A.P. Felty. Lightweight lemmas in AProlog. 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. Clement, T. Despeyroux, J. Incerpi, G. Kahn, B. Lang, and V. Pas-cual. Centaur: The system. In Proceedings of SIGSOFT'88: Third Annual Symposium on Software Development Environments (SDE3), Boston, 1988.
4. J. Despeyroux. A higher-order specification of the-calculus. In First IFIP International Conference on Theoretical Computer Science. Springer-Verlag Lecture Notes in Computer Science, 2000.
5. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In Second International Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science, Apr. 1995.
6. J. Despeyroux and A. Hirschowitz. Higher-order syntax and induction in coq. In Fifth International Conference on Logic Programming and Automated Reasoning. Springer-Verlag Lecture Notes in Computer Science, 1994.
7. J. Despeyroux, F. Pfenning, and C. Schurmann. Primitive recursion for higher-order abstract syntax. In Third International Conference on Typed Lambda Calculi and Applications. Springer-Verlag Lecture Notes in Computer Science, 1997.
8. L.-H. Eriksson. A finitary version of the calculus of partial inductive definitions. In L.-H. Eriksson, L. Hallnas, and P. Schroeder-Heister, editors, Proceedings of the January 1991 Workshop on Extensions to Logic Programming. Springer-Verlag Lecture Notes in Artificial Intelligence, 1992.
9. R. Harper, F. Honsell, and G Plotkin. A framework for defining logics. Journal of the ACM, 40(1), Jan. 1993.
10. M. Hofmann. Semantical analysis of higher-order abstract syntax. In Fourteenth Annual Symposium on Logic in Computer Science, 1999.
11. F. Honsell, M. Miculan, and I. Scagnetto. calculus in (co)inductive type theories. Theoretical Computer Science, 253(2), 2001.
12. R. McDowell. Reasoning in a Logic with Definitions and Induction. PhD thesis, University of Pennsylvania, December 1997.
13. R. McDowell and D. Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic, 3(1), Jan. 2002.
14. M. Miculan. Developing (meta)theory of A-calculus in the theory of contexts. Electronic Notes on Theoretical Computer Science, 58, 2001.
15. M. Miculan. On the formalization of the modal ^-calculus in the calculus of inductive constructions. Information and Computation, 164(1), 2001.
16. G. Nadathur and D. Miller. An overview of AProlog. In K. Bowen and R. Kowalski, editors, Fifth International Conference and Symposium on Logic Programming. MIT Press, 1988.
17. G. Necula. Proof-carrying code. In 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, Jan. 1997.
18. F. Pfenning and E. Rohwedder. Implementing the meta-theory of deductive systems. In Eleventh International Conference on Automated Deduction, volume 607. Lecture Notes in Computer Science, 1992.
19. F. Pfenning and C. Schurmann. System description: Twelf— A meta-logical framework for deductive systems. In Sixteenth International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999.
20. C. Schurmann. Automating the Meta Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, 2000.
21. The Coq Development Team. The Coq Proof Assistant reference manual: Version 7.2. Technical report, INRIA, 2002.