Multi-level meta-reasoning with higher-order abstract syntax

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

Volumn 2620, Issue , 2003, Pages 375-391

  Momigliano, Alberto ^a   Ambler, Simon J ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SYNTACTICS;

CO INDUCTIONS; HIGHER-ORDER ABSTRACT SYNTAX; METAREASONING; MULTILEVELS; SUBJECT REDUCTION; TACTICAL THEOREM PROVING; TARGET LANGUAGE; TYPE THEORY;

COMPUTATION THEORY;

EID: 35248899261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_24     Document Type: Article

References (21)

1. S. Ambler, R. Croie, and A. Momigliano. Combining higher order abstract syntax with tactical theorem proving and (co)induction. In V. A. Carreño, editor, Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, volume 2342 of LNCS. Springer Verlag, 2002.
2. S. Boutin. Proving correctness of the translation from mini-ML to the CAM with the Coq proof development system. Technical Report RR-2536, Inria, Institut National de Recherche en Informatique et en Automatique, 1995.
3. B. Ciesielski and M. Wand. Using the theorem prover Isabelle-91 to verify a simple proof of compiler correctness. Technical Report NU-CCS-91-20, College of Computer Science, Northeastern University, Dec. 1991.
4. J. Despeyroux. Proof of translation in natural semantics. In Proceedings of LICS'86, pages 193-205, Cambridge, MA, 1986. IEEE Computer Society Press.
5. J. Despeyroux, A. Felty, and A. Hirschowitz. Higher-order abstract syntax in Coq. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 124-138, Edinburgh, Scotland, Apr. 1995. Springer-Verlag LNCS 902.
6. A. Felty. Two-level meta-reasoning in Coq. In V. A. Carreño, editor, Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics, volume 2342 of LNCS. Springer Verlag, 2002.
7. M. Gabbay and A. Pitts. A new approach to abstract syntax involving binders. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 214-224, 1999. IEEE Computer Society Press.
8. L. Hallnas. Partial inductive definitions. TCS, 87(1):115-147, July 1991.
9. J. Hannan and D. Miller. From operational semantics to abstract machines. Mathematical Structures in Computer Science, 2(4):415-459, 1992.
10. J. Hannan and F. Pfenning. Compiler verification in LF. In A. Scedrov, editor, Seventh Annual IEEE Symposium on Logic in Computer Science, pages 407-418, Santa Cruz, California, June 1992.
11. P. H. Hartel and L. Moreau. Formalizing the safety of Java,the Java Virtual Machine, and Java Card. ACMCS, 33(4):517-558, Dec. 2001.
12. F. Honsell, M. Miculan, and I. Scagnetto. An axiomatic approach to metareasoning on systems in higher-order abstract syntax. In Proc. ICALP'01, number 2076 in LNCS, pages 963-978. Springer-Verlag, 2001.
13. D. Lester and S. Mintchev. Towards machine-checked compiler correctness for higher-order pure functional languages. In L. Pacholski and J. Tiuryn, editors, Computer Science Logic, pages 369-381. Springer-Verlag LNCS 933, 1995.
14. R. McDowell and D. Miller. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic, 3(1):80-136, 2002.
15. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991.
16. R. Milner and M. Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87:209-220, 1991.
17. A. Momigliano, S. Ambler, and R. Croie. A Hybrid encoding of Howe's method for establishing congruence of bisimilarity. ENTCS, 70(2), 2002.
18. F. Pfenning. Computation and Deduction. Cambridge University Press, 2000. In preparation. Draft from April 1997 available electronically.
19. F. Pfenning and E. Rohwedder. Implementing the meta-theory of deductive systems. In D. Kapur, editor, Proceedings of the 11th International Conference on Automated Deduction, pages 537-551. Springer-Verlag LNAI 607.
20. F. Pfenning and C. Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of CADE 16, pages 202-206. Springer LNAI 1632.
21. C. Schürmann. Automating the Meta-Theory of Deductive Systems. PhD thesis, Carnegie-Mellon University, 2000. CMU-CS-00-146.