The subtyping problem for second-order types is undecidable. (Q1400717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The subtyping problem for second-order types is undecidable. |
scientific article; zbMATH DE number 1964179
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The subtyping problem for second-order types is undecidable. |
scientific article; zbMATH DE number 1964179 |
Statements
The subtyping problem for second-order types is undecidable. (English)
0 references
2002
0 references
type-checking
0 references
polymorphic lambda-calculus
0 references
0.86214435
0 references
0.83523333
0 references
0.83481896
0 references
0.83415145
0 references
