Two-Level Hybrid: A System for Reasoning Using Higher-Order Abstract Syntax

Electronic Notes in Theoretical Computer Science

Volumn 196, Issue C, 2008, Pages 85-93

  Momigliano, Alberto ^a   Martin, Alan J ^b   Felty, Amy P ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

higher order abstract syntax; induction; interactive theorem proving; Isabelle HOL; variable binding

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; INFORMATION SYSTEMS; OBJECT ORIENTED PROGRAMMING;

HIGHER-ORDER ABSTRACT SYNTAX; INDUCTION; INTERACTIVE THEOREM PROVING; ISABELLE/HOL; VARIABLE BINDING;

LOGIC PROGRAMMING;

EID: 38749121327     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.09.019     Document Type: Article

References (18)

1. The Coq proof assistant, v.8.0. http://coq.inria.fr/
2. Isabelle/Isar (2005). http://isabelle.in.tum.de/Isar
3. Ott. http://www.cl.cam.ac.uk/~pes20/ott/
4. Ambler S., Crole R., and Momigliano A. Combining higher order abstract syntax with tactical theorem proving and (co)induction. Fifteenth International Conference on Theorem Proving in Higher-Order Logics. LNCS 2342 (2002), Springer-Verlag 13-30
5. Ambler, S.J., R.L. Crole and A. Momigliano, A definitional approach to primitive recursion over higher order abstract syntax, in: ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding (2003), pp. 1-11
6. Aydemir B.E., et al. Mechanized metatheory for the masses: the PoplMark challenge. Eighteenth International Conference on Theorem Proving in Higher-Order Logics. LNCS 3605 (2005), Springer-Verlag 50-65
7. Capretta V., and Felty A. Proceedings of TYPES 2006. LNCS 4502 (2007), Springer-Verlag 63-77
8. de Bruijn N.G. Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indagationes Mathematicæ 34 (1972) 381-392
9. Felty A. Two-level meta-reasoning in Coq. Fifteenth International Conference on Theorem Proving in Higher-Order Logics. LNCS 2342 (2002), Springer-Verlag 198-213
10. Gordon A. A mechanisation of name-carrying syntax up to α-conversion. Higher Order Logic Theorem Proving and its Applications. LNCS 780 (1993), Springer-Verlag 414-426
11. Honsell F., Miculan M., and Scagnetto I. An axiomatic approach to metareasoning on nominal algebras in HOAS. 28th International Colloquium on Automata, Languages and Programming. LNCS 2076 (2001), Springer-Verlag 963-978
12. McDowell R., and Miller D. Reasoning with higher-order abstract syntax in a logical framework. ACM Transactions on Computational Logic 3 (2002) 80-136
13. Momigliano A., Ambler S., and Crole R. A Hybrid encoding of Howe's method for establishing congruence of bisimilarity. Electronic Notes in Theoretical Computer Science 70 (2002) 60-75
14. Momigliano A., and Ambler S.J. Multi-level meta-reasoning with higher order abstract syntax. Sixth International Conference on Foundations of Software Science and Computational Structures. LNCS 2620 (2003), Springer-Verlag 375-391
15. Momigliano, A. and J. Polakow, A formalization of an ordered logical framework in Hybrid with applications to continuation machines, in: ACM SIGPLAN Workshop on Mechanized Reasoning about Languages with Variable Binding (2003), pp. 1-9
16. Pfenning F., and Schürmann C. System description: Twelf - a meta-logical framework for deductive systems. Sixteenth International Conference on Automated Deduction. LNCS 1632 (1999), Springer-Verlag 202-206
17. Tiu, A., "A Logical Framework for Reasoning about Logical Specifications," Ph.D. thesis, Pennsylvania State University (2004)
18. Urban C., and Tasson C. Nominal techniques in Isabelle/HOL. Twentieth International Conference on Automated Deduction. LNCS 3632 (2005), Springer-Verlag 38-53