Bounded Quantification is Undecidable

Bounded Quantification is Undecidable (1993)

Cached

Download Links

[www.cis.upenn.edu]

Other Repositories/Bibliography

DBLP

by Benjamin C. Pierce

Venue:	Information and Computation
Citations:	97 - 9 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Bounded Quantification is Undecidable	user correction - Legacy Corrections
AUTHOR NAME	Benjamin C. Pierce	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, PA 15213-3890, USA	SVM HeaderParse 0.1
ABSTRACT	F is a typed -calculus with subtyping and bounded second-order polymorphism. First proposed by Cardelli and Wegner, it has been widely studied as a core calculus for type systems with subtyping. Curien and Ghelli proved the partial correctness of a recursive procedure for computing minimal types of F terms and showed that the termination of this procedure is equivalent to the termination of its major component, a procedure for checking the subtype relation between F types. This procedure was thought to terminate on all inputs, but the discovery of a subtle bug in a purported proof of this claim recently reopened the question of the decidability of subtyping, and hence of typechecking. This question is settled here in the negative, using a reduction from the halting problem for two-counter Turing machines to show that the subtype relation of F is undecidable. 1 Introduction The notion of bounded quantification was introduced by Cardelli and Wegner [16] in the language Fun. Based on i...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
VENUE	Information and Computation	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	305--315	INFERENCE
VOLUME	112	INFERENCE
CITATIONS	7 found	ParsCit 1.0