Pages that link to "Item:Q1400717"
From MaRDI portal
The following pages link to The subtyping problem for second-order types is undecidable. (Q1400717):
Displaying 8 items.
- A language for generic programming in the large (Q532409) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- Bounded quantification is undecidable (Q1327694) (← links)
- Subtyping recursion and parametric polymorphism in kernel Fun (Q1780453) (← links)
- A sequent calculus for subtyping polymorphic types (Q1854408) (← links)
- Non-structural subtype entailment in automata theory (Q1887157) (← links)
- Intersection, Universally Quantified, and Reference Types (Q3644750) (← links)
- The first-order theory of subtyping constraints (Q5178907) (← links)