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
Equational Axiomatization of Bicoercibility for Polymorphic Types
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Intersection types and computational effects
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
An Algebraic Characterization of Typability in ML with Subtyping
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Subtyping, recursion, and parametric polymorphism in kernel fun
Information and Computation
Boxy types: inference for higher-rank types and impredicativity
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Practical type inference for arbitrary-rank types
Journal of Functional Programming
Subtyping recursion and parametric polymorphism in kernel fun
Information and Computation
Products and Polymorphic Subtypes
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Complete and easy bidirectional typechecking for higher-rank polymorphism
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
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.