Pages that link to "Item:Q922718"

The following pages link to A modest model of records, inheritance, and bounded quantification (Q922718):

Displayed 15 items.

• Divergence of \(F_{\leq}\) type checking (Q673966) ‎ (← links)
• A lambda-calculus for dynamic binding (Q1127514) ‎ (← links)
• Another definition of order-sorted algebra (Q1273072) ‎ (← links)
• Termination of system \(F\)-bounded: A complete proof (Q1383151) ‎ (← links)
• Higher-order subtyping (Q1392282) ‎ (← links)
• Typed operational semantics for higher-order subtyping. (Q1401950) ‎ (← links)
• Polymorphic lambda calculus and subtyping. (Q1605176) ‎ (← links)
• Basic theory of \(F\)-bounded quantification. (Q1854309) ‎ (← links)
• A sequent calculus for subtyping polymorphic types (Q1854408) ‎ (← links)
• Logical equivalence for subtyping object and recursive types (Q2481559) ‎ (← links)
• CPO-models for second order lambda calculus with recursive types and subtyping (Q3142273) ‎ (← links)
• Coherence of subsumption, minimum typing and type-checking in F ≤ (Q4005456) ‎ (← links)
• Toward a semantics for the QUEST language (Q4365022) ‎ (← links)
• A paradigmatic object-oriented programming language: Design, static typing and semantics (Q4764618) ‎ (← links)
• Simple type-theoretic foundations for object-oriented programming (Q4764619) ‎ (← links)