Pages that link to "Item:Q1110312"

The following pages link to Polymorphic type inference and containment (Q1110312):

Displaying 43 items.

• A Church-style intermediate language for ML\(^{\text F}\) (Q428892) (← links)
• A language for generic programming in the large (Q532409) (← links)
• The semantics of second-order lambda calculus (Q751294) (← links)
• Type inference with recursive types: Syntax and semantics (Q756435) (← links)
• A modest model of records, inheritance, and bounded quantification (Q922718) (← links)
• Recasting ML\(^{\text F}\) (Q1023287) (← links)
• Fully abstract submodels of typed lambda calculi (Q1095880) (← links)
• Recursion over realizability structures (Q1173956) (← links)
• Recursive types for Fun (Q1176245) (← links)
• Filter models with polymorphic types (Q1186431) (← links)
• Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus (Q1193590) (← links)
• Complete restrictions of the intersection type discipline (Q1193654) (← links)
• Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
• Nominalization, predication and type containment (Q1314276) (← links)
• Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
• \(F\)-semantics for type assignment systems (Q1329739) (← links)
• Intersection type assignment systems (Q1350344) (← links)
• Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
• System ST toward a type system for extraction and proofs of programs (Q1400600) (← links)
• The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
• Generalized filter models (Q1575259) (← links)
• A sequent calculus for subtyping polymorphic types (Q1854408) (← links)
• Logic of subtyping (Q2500487) (← links)
• Domain-Free<i>λµ</i>-Calculus (Q2729625) (← links)
• The Relevance of Semantic Subtyping (Q2842838) (← links)
• A System F with Call-by-Name Exceptions (Q3519511) (← links)
• On the building of affine retractions (Q3520151) (← links)
• A Polymorphic Type System for the Lambda-Calculus with Constructors (Q3637198) (← links)
• Intersection, Universally Quantified, and Reference Types (Q3644750) (← links)
• Complete Types in an Extension of the System <i>AF</i>2 (Q3647204) (← links)
• Constructive natural deduction and its ‘ω-set’ interpretation (Q4006232) (← links)
• Semantics of the second order lambda calculus (Q4006235) (← links)
• A paradigmatic object-oriented programming language: Design, static typing and semantics (Q4764618) (← links)
• Syntactic soundness proof of a type-and-capability system with hidden state (Q4912884) (← links)
• A semantic basis for Quest (Q4939689) (← links)
• Type inference with simple subtypes (Q4939703) (← links)
• Types as parameters (Q5044771) (← links)
• A semantics for type checking (Q5096209) (← links)
• Type inference in polymorphic type discipline (Q5096210) (← links)
• Typed equivalence, type assignment, and type containment (Q5881295) (← links)
• Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) (← links)
• Completeness of type assignment systems with intersection, union, and type quantifiers (Q5958301) (← links)
• Signature restriction for polymorphic algebraic effects (Q6594243) (← links)