A broader class of trees for recursive type definitions for HOL

  • Elsa L. Gunter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 780)


In this paper we describe the construction in Hol of the inductive type of arbitrarily branching labeled trees. Such a type is characterized by an initiality theorem similar to that for finitely branching labeled trees. We discuss how to use this type to extend the system of simple recursive type specifications automatically definable in Hol to ones including a limited class of functional arguments. The work discussed here is a part of a larger project to expand the recursive types package of Hol which is nearing completion. All work described in this paper has been completed.


Partial Function Label Tree Type Constructor Background Type Case Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. J. C. Gordon. The HOL System. Cambridge Research Centre, SRI International, and DSTO Australia, 1989.Google Scholar
  2. 2.
    T. F. Melham. Automating recursive type definitions in higher order logic. In G. Birtwistle and P. A. Subrahmanyam, editors, Current Trends in Hardware Verification and Automated Theorem Proving, pages 341–386. Springer-Verlag, 1989.Google Scholar
  3. 3.
    T.F. Melham. Email correspondence, info-hol email, 26 April 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Elsa L. Gunter
    • 1
  1. 1.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations