Basic theory of \(F\)-bounded quantification. (Q1854309): Difference between revisions

@@ Property / DOI @@
-.1006/inco.1999.2802
@@ Property / DOI: 10.1006/inco.1999.2802 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/inco.1999.2802
+Normal rank
@@ Property / OpenAlex ID @@
+W2000785911
@@ Property / OpenAlex ID: W2000785911 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursion over realizability structures
@@ Property / cites work: Recursion over realizability structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999206
@@ Property / cites work: Q3999206 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing object encodings.
@@ Property / cites work: Comparing object encodings. / rank @@
+Normal rank
@@ Property / cites work @@
+A modest model of records, inheritance, and bounded quantification
+Normal rank
@@ Property / cites work @@
+Q4692468
@@ Property / cites work: Q4692468 / rank @@
+Normal rank
@@ Property / cites work @@
+A paradigmatic object-oriented programming language: Design, static typing and semantics
+Normal rank
@@ Property / cites work @@
+Integration of parametric and ``ad hoc'' second order polymorphism in a calculus with subtyping
+Normal rank
@@ Property / cites work @@
+Unifying overloading and \(\lambda\)-abstraction: \(\lambda^{\{\,\}}\)
+Normal rank
@@ Property / cites work @@
+Coherence of subsumption, minimum typing and type-checking in F ≤
+Normal rank
@@ Property / cites work @@
+Decidability and confluence of \(\beta\eta\text{top}_ \leqslant\) reduction in \({\mathbb{F}}_ \leqslant\)
+Normal rank
@@ Property / cites work @@
+Q4281468
@@ Property / cites work: Q4281468 / rank @@
+Normal rank
@@ Property / cites work @@
+A calculus for overloaded functions with subtyping
+Normal rank
@@ Property / cites work @@
+A semantic basis for Quest
@@ Property / cites work: A semantic basis for Quest / rank @@
+Normal rank
@@ Property / cites work @@
+An extension of system \(F\) with subtyping
@@ Property / cites work: An extension of system \(F\) with subtyping / rank @@
+Normal rank
@@ Property / cites work @@
+Q5667469
@@ Property / cites work: Q5667469 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281471
@@ Property / cites work: Q4281471 / rank @@
+Normal rank
@@ Property / cites work @@
+Divergence of \(F_{\leq}\) type checking
@@ Property / cites work: Divergence of \(F_{\leq}\) type checking / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of system \(F\)-bounded: A complete proof
+Normal rank
@@ Property / cites work @@
+Edinburgh LCF. A mechanized logic of computation
@@ Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded existentials and minimal typing
@@ Property / cites work: Bounded existentials and minimal typing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4288818
@@ Property / cites work: Q4288818 / rank @@
+Normal rank
@@ Property / cites work @@
+Positive subtyping
@@ Property / cites work: Positive subtyping / rank @@
+Normal rank
@@ Property / cites work @@
+A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond
+Normal rank
@@ Property / cites work @@
+Bounded quantification is undecidable
@@ Property / cites work: Bounded quantification is undecidable / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection types and bounded polymorphism
@@ Property / cites work: Intersection types and bounded polymorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Higher-order subtyping
@@ Property / cites work: Higher-order subtyping / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068054
@@ Property / cites work: Q4068054 / rank @@
+Normal rank
@@ Property / DOI @@
+.1006/INCO.1999.2802
@@ Property / DOI: 10.1006/INCO.1999.2802 / rank @@
+Normal rank