A broader class of trees for recursive type definitions for HOL
| Elsa L. Gunter |
| AT&T Bell Labs |
Abstract:
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.
Bibtex Entry
@inproceedings{bonsai,
author = "Elsa L. Gunter",
title = "A Broader Class of Trees for Recursive Type Definitions
for {HOL}",
booktitle = "Higher Order Logic Theorem Proving and Its Applications",
publisher = "Springer-Verlag",
year = 1994,
editor = "Jeffery Joyce and Carl Seger",
volume = 780,
series = "Lecture Notes in Computer Science",
pages = "141--154",
month = "February"
}
Postscript version of paper
Back to
bibliography
Elsa Gunter