Pages that link to "Item:Q1327694"
From MaRDI portal
The following pages link to Bounded quantification is undecidable (Q1327694):
Displaying 12 items.
- Divergence of \(F_{\leq}\) type checking (Q673966) (← links)
- Recasting ML\(^{\text F}\) (Q1023287) (← links)
- Bounded existentials and minimal typing (Q1127527) (← links)
- Higher-order subtyping (Q1392282) (← links)
- The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
- On the decidability of subtyping with bounded existential types and implementation constraints (Q1758661) (← links)
- Subtyping recursion and parametric polymorphism in kernel Fun (Q1780453) (← links)
- Basic theory of \(F\)-bounded quantification. (Q1854309) (← links)
- Comparing object encodings. (Q1854318) (← links)
- Type destructors (Q1854494) (← links)
- Foundations for virtual types (Q1854531) (← links)
- Principality and type inference for intersection types using expansion variables (Q1884929) (← links)
