The HOL logic extended with quantification over type variables

The HOL logic extended with quantification over type variables (1993)

by Thomas F. Melham

Venue:	Formal Methods in System Design, 3(1--2):7--24
Citations:	18 - 0 self

Datum	Value	Source
TITLE	The HOL logic extended with quantification over type variables	INFERENCE
AUTHOR NAME	Thomas F. Melham	SVM HeaderParse 0.2
AUTHOR AFFIL	New Museums Site, Pembroke Street,	SVM HeaderParse 0.2
ABSTRACT	Abstract. The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic underlying the HOL system with a very simple form of quantification over types. It is shown how certain practical problems with using the definitional mechanisms of HOL would be solved by the additional expressive power gained by making this extension.	SVM HeaderParse 0.2
YEAR	1993	INFERENCE
VENUE	Formal Methods in System Design, 3(1--2):7--24	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	3--18	INFERENCE
CITATIONS	7 found	ParsCit 1.0