HOL Light: A tutorial introduction

HOL Light: A tutorial introduction (1996)

by John Harrison

Venue:	Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD’96), volume 1166 of Lecture Notes in Computer Science
Citations:	52 - 9 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	HOL Light: A tutorial introduction	INFERENCE
AUTHOR NAME	John Harrison	SVM HeaderParse 0.1
AUTHOR AFFIL	Abo Akademi University, Department of Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Lemminkaisenkatu 14a, 20520 Turku, Finland	SVM HeaderParse 0.1
ABSTRACT	HOL Light is a new version of the HOL theorem prover. While retaining the reliability and programmability of earlier versions, it is more elegant, lightweight, powerful and automatic; it will be the basis for the Cambridge component of the HOL-2000 initiative to develop the next generation of HOL theorem provers. HOL Light is written in CAML Light, and so will run well even on small machines, e.g. PCs and Macintoshes with a few megabytes of RAM. This is in stark contrast to the resource-hungry systems which are the norm in this field, other versions of HOL included. Among the new features of this version are a powerful simplifier, effective first order automation, simple higher-order matching and very general support for inductive and recursive definitions.	user correction - Legacy Corrections
YEAR	1996	INFERENCE
VENUE	Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD’96), volume 1166 of Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	265--269	INFERENCE
VOLUME	1166	INFERENCE
CITATIONS	12 found	ParsCit 1.0