The Subtyping Problem for Second-Order Types Is Undecidable
- 1 November 2002
- journal article
- Published by Elsevier BV in Information and Computation
- Vol. 179 (1), 1-18
- https://doi.org/10.1006/inco.2001.2950
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Typability and type checking in System F are equivalent and undecidableAnnals of Pure and Applied Logic, 1999
- Polymorphic subtyping without distributivityLecture Notes in Computer Science, 1998
- Equational axiomatization of bicoercibility for polymorphic typesLecture Notes in Computer Science, 1995
- Bounded Quantification Is UndecidableInformation and Computation, 1994
- Polymorphic type inference and containmentInformation and Computation, 1988