Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction

  • Simon J. Ambler
  • Roy L. Crole
  • Alberto Momigliano
Conference paper

DOI: 10.1007/3-540-45685-6_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2410)
Cite this paper as:
Ambler S.J., Crole R.L., Momigliano A. (2002) Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction. In: Carreño V.A., Muñoz C.A., Tahar S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg

Abstract

Combining Higher Order Abstract Syntax (HOAS) and induction is well known to be problematic. We have implemented a tool called Hybrid, within Isabelle HOL, which does allow object logics to be represented using HOAS, and reasoned about using tactical theorem proving in general and principles of (co)induction in particular. In this paper we describe Hybrid, and illustrate its use with case studies. We also provide some theoretical adequacy results which underpin our practical work.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Simon J. Ambler
    • 1
  • Roy L. Crole
    • 1
  • Alberto Momigliano
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of LeicesterLeicesterUK

Personalised recommendations