Divergence of F_ type checking
From MaRDI portal
Publication:673966
Recommendations
Cites work
- A modest model of records, inheritance, and bounded quantification
- A paradigmatic object-oriented programming language: Design, static typing and semantics
- A semantic basis for Quest
- An extension of system \(F\) with subtyping
- Bounded quantification is undecidable
- Coherence of subsumption, minimum typing and type-checking in F ≤
- Decidability and confluence of \(\beta\eta\text{top}_ \leqslant\) reduction in \({\mathbb{F}}_ \leqslant\)
- Divergence of \(F_{\leq}\) type checking
- scientific article; zbMATH DE number 3485174 (Why is no real title available?)
- scientific article; zbMATH DE number 512778 (Why is no real title available?)
- scientific article; zbMATH DE number 814802 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- Operations on records
- Type theories and object-oriented programmimg
Cited in
(9)- Bounded existentials and minimal typing
- Bounded quantification is undecidable
- Higher-order subtyping
- Subtyping recursion and parametric polymorphism in kernel Fun
- Basic theory of F-bounded quantification.
- Comparing object encodings.
- scientific article; zbMATH DE number 512778 (Why is no real title available?)
- scientific article; zbMATH DE number 1870414 (Why is no real title available?)
- Divergence of \(F_{\leq}\) type checking
This page was built for publication: Divergence of \(F_{\leq}\) type checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673966)
