A broader class of trees for recursive type definitions for HOL

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

Volumn 780 LNCS, Issue , 1994, Pages 141-154

  Gunter, Elsa L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORESTRY; FORMAL LOGIC;

FUNCTIONAL ARGUMENTS; INDUCTIVE-TYPE; LABELED TREES; RECURSIVE TYPES;

THEOREM PROVING;

EID: 84956853741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57826-9_131     Document Type: Conference Paper

References (3)

1. M. J. C. Gordon. The HOL System. Cambridge Research Centre, SRI International, and DSTO Australia, 1989.
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.
3. T.F. Melham. Email correspondence, info-hol email, 26 April 1992.