Name
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. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/inco.2001.2950 | Information and Computation/information and Control |
Keywords | DocType | Volume |
polymorphism,second order,lambda calculus | Conference | 179 |
Issue | ISSN | ISBN |
1 | Information and Computation | 0-8186-7463-6 |
Citations | PageRank | References |
21 | 1.07 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jerzy Tiuryn | 1 | 1210 | 126.00 |
| Pawel Urzyczyn | 2 | 333 | 33.29 |