DOI 10.1016/S0019-9958(86)80019-5 zbMath 0636.68016 OpenAlex W2090415524 MaRDI QID Q3776602
Ravi Sethi , David B. MacQueen , Gordon D. Plotkin
Publication date : 1986Published in : Information and Control (Search for Journal in Brave )Full work available at URL : https://doi.org/10.1016/s0019-9958(86)80019-5
A Realizability Interpretation for Intersection and Union Types ⋮
Categorical models for non-extensional λ-calculi and combinatory logic ⋮
Pebble, a kernel language for modules and abstract data types ⋮
A semantics of multiple inheritance ⋮
Polymorphic type inference and containment ⋮
Semantics of the second order lambda calculus ⋮
Labelled reductions, runtime errors, and operational subsumption ⋮
The ``relevance of intersection and union types ⋮ Intersection and union types ⋮ Singleton, union and intersection types for program extraction ⋮ A record calculus with principal types ⋮ Meta-circular interpreter for a strongly typed language ⋮ Modelling multiple inheritance with colimits ⋮ Type classes with existential types ⋮ Intuitionistic fixed point logic ⋮ Recursion over realizability structures ⋮ Recursive types for Fun ⋮ Bunched polymorphism ⋮ Toward a semantics for the QUEST language ⋮ Syntactic soundness proof of a type-and-capability system with hidden state ⋮ Realisability semantics of parametric polymorphism, general references and recursive types ⋮ An introduction to metric semantics: Operational and denotational models for programming and specification languages ⋮ Type inference with simple subtypes ⋮ Logic of subtyping ⋮ Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models ⋮ Completeness of type assignment systems with intersection, union, and type quantifiers ⋮ Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types ⋮ The semantics of second-order lambda calculus ⋮ Type inference with recursive types: Syntax and semantics ⋮ Domain theoretic models of polymorphism ⋮ Simplifying subtyping constraints: a theory ⋮ Type inference, abstract interpretation and strictness analysis ⋮ Baby Modula-3 and a theory of objects ⋮ Polymorphic lambda calculus and subtyping. ⋮ Isomorphism of intersection and union types ⋮ Combining type disciplines ⋮ A coinductive completeness proof for the equivalence of recursive types ⋮ Elaborating intersection and union types ⋮ Subtyping constrained types
This page was built for publication: An ideal model for recursive polymorphic types
