Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering

Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering (1999)

by Stefan Berghofer , Markus Wenzel

Venue:	Theorem Proving in Higher Order Logics: TPHOLs ’99, LNCS 1690
Citations:	30 - 5 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering	user correction - Legacy Corrections
AUTHOR NAME	Stefan Berghofer	SVM HeaderParse 0.1
AUTHOR AFFIL	Technische Universitat Munchen; Institut fur Informatik	SVM HeaderParse 0.2
AUTHOR ADDR	Arcisstrae 21, 80290 Munchen, Germany	SVM HeaderParse 0.1
AUTHOR NAME	Markus Wenzel	SVM HeaderParse 0.1
AUTHOR AFFIL	Technische Universitat Munchen; Institut fur Informatik	SVM HeaderParse 0.2
AUTHOR ADDR	Arcisstrae 21, 80290 Munchen, Germany	SVM HeaderParse 0.1
ABSTRACT	Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and most other implementations, Isabelle/HOL datatypes may be mutually and indirect recursive, even infinitely branching. We also support inverted datatype definitions for characterizing existing types as being inductive ones later. All our constructions are fully definitional according to established HOL tradition. Stepping back from the logical details, we also see this work as a typical example of what could be called "Formal-Logic Engineering". We observe that building realistic theorem proving environments involves further issues rather than pure logic only. 1	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	Theorem Proving in Higher Order Logics: TPHOLs ’99, LNCS 1690	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
VOLUME	1690	INFERENCE
CITATIONS	24 found	ParsCit 1.0