Pages that link to "Item:Q3776602"

The following pages link to An ideal model for recursive polymorphic types (Q3776602):

Displaying 41 items.

• The semantics of second-order lambda calculus (Q751294) (← links)
• Type inference with recursive types: Syntax and semantics (Q756435) (← links)
• Meta-circular interpreter for a strongly typed language (Q908683) (← links)
• Modelling multiple inheritance with colimits (Q919836) (← links)
• Pebble, a kernel language for modules and abstract data types (Q1104071) (← links)
• A semantics of multiple inheritance (Q1106652) (← links)
• Polymorphic type inference and containment (Q1110312) (← links)
• Recursion over realizability structures (Q1173956) (← links)
• Recursive types for Fun (Q1176245) (← links)
• Filter models with polymorphic types (Q1186431) (← links)
• Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
• Combining type disciplines (Q1319505) (← links)
• The ``relevance'' of intersection and union types (Q1381437) (← links)
• Polymorphic lambda calculus and subtyping. (Q1605176) (← links)
• A coinductive completeness proof for the equivalence of recursive types (Q1607224) (← links)
• Domain theoretic models of polymorphism (Q1824612) (← links)
• Simplifying subtyping constraints: a theory (Q1854464) (← links)
• Intuitionistic fixed point logic (Q2220485) (← links)
• Logic of subtyping (Q2500487) (← links)
• Elaborating intersection and union types (Q2875228) (← links)
• A Realizability Interpretation for Intersection and Union Types (Q3179292) (← links)
• Bunched polymorphism (Q3545274) (← links)
• Realisability semantics of parametric polymorphism, general references and recursive types (Q3583027) (← links)
• Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types (Q3617747) (← links)
• Semantics of the second order lambda calculus (Q4006235) (← links)
• Categorical models for non-extensional λ-calculi and combinatory logic (Q4279260) (← links)
• Toward a semantics for the QUEST language (Q4365022) (← links)
• Labelled reductions, runtime errors, and operational subsumption (Q4572006) (← links)
• Baby Modula-3 and a theory of objects (Q4764620) (← links)
• Syntactic soundness proof of a type-and-capability system with hidden state (Q4912884) (← links)
• Type inference with simple subtypes (Q4939703) (← links)
• Subtyping constrained types (Q5030204) (← links)
• Intersection and union types (Q5096243) (← links)
• Singleton, union and intersection types for program extraction (Q5096245) (← links)
• A record calculus with principal types (Q5096310) (← links)
• Isomorphism of intersection and union types (Q5268999) (← links)
• Programming Languages and Systems (Q5493373) (← links)
• Type classes with existential types (Q5687911) (← links)
• An introduction to metric semantics: Operational and denotational models for programming and specification languages (Q5941193) (← 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)