Inductive datatypes in HOL -- lessons learned in formal-logic engineering (Q4945200)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1424012
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inductive datatypes in HOL -- lessons learned in formal-logic engineering |
scientific article; zbMATH DE number 1424012 |
Statements
26 October 2000
0 references
theorem proving
0 references
higher-order logics
0 references
inductive definitions
0 references
inductive datatypes
0 references
0.8021678328514099
0 references
0.7949637770652771
0 references
0.7777242064476013
0 references
Inductive datatypes in HOL -- lessons learned in formal-logic engineering (English)
0 references
The paper examines theorem proving systems for higher-order logics. In particular the system HOL [see, e.g., \textit{M. J. Gordon} and \textit{T. F. Melham} (eds.), Introduction to HOL -- A theorem proving environment for higher order logic. Cambridge: Univ. Press (1993; Zbl 0779.68007)] is studied. It is argued that, for the practical success of a theorem prover, not only the expressive power of the underlying logics is important, but one relevant additional aspect is the possibility of advanced definitional mechanisms. Thus, here, an extension of HOL is discussed which allows inductive datatype definitions. A formal treatement and a number of examples from the user-level view are presented. For the entire collection see [Zbl 0929.00038].
0 references