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

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

Revision as of 10:07, 5 June 2024

scientific article
Language Label Description Also known as
English
Basic theory of \(F\)-bounded quantification.
scientific article

    Statements

    Basic theory of \(F\)-bounded quantification. (English)
    0 references
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    binary methods
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references