The subtyping problem for second-order types is undecidable

Authors:
Jerzy Tiuryn;Pawel Urzyczyn
Affiliations:
Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland;Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
Venue:
Information and Computation
Year:
2002

Citing 8
Cited 5

Polymorphic type inference and containment

Information and Computation - Semantics of Data Types
Bounded quantification is undecidable

Information and Computation
Putting type annotations to work

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Polymorphic Subtyping Without Distributivity

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Equational Axiomatization of Bicoercibility for Polymorphic Types

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
A logic of subtyping

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Typability is Undecidable for F+Eta

Typability is Undecidable for F+Eta

Products and polymorphic subtypes

Fundamenta Informaticae
Essential language support for generic programming

Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Simple, partial type-inference for System F based on type-containment

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Intersection, universally quantified, and reference types

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
A language for generic programming in the large

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that the subtyping problem induced by Mitchell's containment relation for second-order polymorphic types is undecidable. It follows that type-checking is undecidable for the polymorphic lambda-calculus extended by an appropriate subsumption rule.