Structured theories in LCF

Structured theories in LCF (1983)

by D. T. Sannella , R. M. Burstall

Venue:	In Proc. 8th Colloq. on Trees in Algebra and Programming, volume 159 of Lecture Notes in Computer Science
Citations:	30 - 7 self

Datum	Value	Source
TITLE	Structured theories in LCF	INFERENCE
AUTHOR NAME	D. T. Sannella	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Edinburgh	SVM HeaderParse 0.2
AUTHOR NAME	R. M. Burstall	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Edinburgh	SVM HeaderParse 0.2
ABSTRACT	Abstract: An extension to the Edinburgh LCF interactive theorem-proving system is described which provides new ways of constructing theories, drawing upon ideas from the Clear specification language. A new theory can be built from an existing theory in two new ways: by renaming its types and constants, or by abstraction (forgetting some types and constants and perhaps renaming the rest]. A way of providing parameterised theories is described. These theory-building operations-- together with operations for forming a primitive theory and for taking the union of theories-- allow large theories to be built in a flexible and well-structured fashion. Inference rules and str~tngies for proof in structured theories are also discussed. 1	SVM HeaderParse 0.2
YEAR	1983	INFERENCE
VENUE	In Proc. 8th Colloq. on Trees in Algebra and Programming, volume 159 of Lecture Notes in Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	1 found	ParsCit 1.0