The subtyping problem for second-order types is undecidable
- 24 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Putting type annotations to workPublished by Association for Computing Machinery (ACM) ,1996
- 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