LCF Examples in HOL

LCF Examples in HOL (1994)

by Sten Agerholm , Sten Agerholm

Venue:	The Computer Journal
Citations:	12 - 4 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	LCF Examples in HOL	INFERENCE
AUTHOR NAME	Sten Agerholm	SVM HeaderParse 0.1
AUTHOR AFFIL	BRICS;, Computer Science Dept.,	SVM HeaderParse 0.2
AUTHOR ADDR	Aarhus University, DK-8000 Aarhus C., Denmark	SVM HeaderParse 0.2
AUTHOR NAME	Sten Agerholm	SVM HeaderParse 0.1
AUTHOR AFFIL	BRICS;, Computer Science Dept.,	SVM HeaderParse 0.2
AUTHOR ADDR	Aarhus University, DK-8000 Aarhus C., Denmark	SVM HeaderParse 0.2
ABSTRACT	The LCF system provides a logic of fixed point theory and is useful to reason about nontermination, recursive definitions and infinite-valued types such as lazy lists. Because of continual presence of bottom elements, it is clumsy for reasoning about finite-valued types and strict functions. The HOL system provides set theory and supports reasoning about finite-valued types and total functions well. In this paper a number of examples are used to demonstrate that an extension of HOL with domain theory combines the benefits of both systems. The examples illustrate reasoning about infinite values and nonterminating functions and show how domain and set theoretic reasoning can be mixed to advantage. An example presents a proof of correctness of a recursive unification algorithm using well-founded induction.	user correction - Legacy Corrections
YEAR	1994	INFERENCE
VENUE	The Computer Journal	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	pp.	INFERENCE
VOLUME	38	INFERENCE
CITATIONS	13 found	ParsCit 1.0