Admissibility of Fixpoint Induction over Partial Types

Admissibility of Fixpoint Induction over Partial Types (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Karl Crary

Venue:	Automated deduction --- CADE-15. Lect. Notes in Comp. Sci
Citations:	6 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Admissibility of Fixpoint Induction over Partial Types	user correction - Legacy Corrections
AUTHOR NAME	Karl Crary	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, PA 15213	SVM HeaderParse 0.1
ABSTRACT	Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned types using fixpoint induction. However, fixpoint induction is valid only on admissible types. Previous work has shown many types to be admissible, but has not shown any dependent products to be admissible. Disallowing recursion on dependent product types substantially reduces the expressiveness of the logic; for example, it prevents much reasoning about modules, objects and algebras. In this paper I present two new tools, predicate-admissibility and monotonicity, for showing types to be admissible. These tools show a wide class of types to be admissible; in particular, they show many dependent products to be admissible. This alleviates difficulties in applying partial types to theorem proving in practice. I also present a general least upper bound theorem for fixed points with regard to a computational approxim...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	Automated deduction --- CADE-15. Lect. Notes in Comp. Sci	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	270--285	INFERENCE
VOLUME	1421	INFERENCE
TECH	Technical report	INFERENCE
CITATIONS	22 found	ParsCit 1.0