Basic theory of F-bounded quantification.
From MaRDI portal
Basic theory of \(F\)-bounded quantification.
Recommendations
Cites work
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 512775 (Why is no real title available?)
- scientific article; zbMATH DE number 512778 (Why is no real title available?)
- scientific article; zbMATH DE number 555217 (Why is no real title available?)
- scientific article; zbMATH DE number 194511 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- A calculus for overloaded functions with subtyping
- A modest model of records, inheritance, and bounded quantification
- A paradigmatic object-oriented programming language: Design, static typing and semantics
- A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond
- A semantic basis for Quest
- An extension of system \(F\) with subtyping
- Bounded existentials and minimal typing
- Bounded quantification is undecidable
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Comparing object encodings.
- Decidability and confluence of \(\beta\eta\text{top}_ \leqslant\) reduction in \({\mathbb{F}}_ \leqslant\)
- Divergence of \(F_{\leq}\) type checking
- Edinburgh LCF. A mechanized logic of computation
- Higher-order subtyping
- Integration of parametric and ``ad hoc second order polymorphism in a calculus with subtyping
- Intersection types and bounded polymorphism
- Positive subtyping
- Recursion over realizability structures
- Termination of system F-bounded: A complete proof
- Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\)
Cited in
(4)
This page was built for publication: Basic theory of \(F\)-bounded quantification.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854309)
