An ideal model for recursive polymorphic types
From MaRDI portal
Publication:3776602
Recommendations
Cited in
(50)- Type inference with recursive types: Syntax and semantics
- The ``relevance of intersection and union types
- Completeness of type assignment systems with intersection, union, and type quantifiers
- Semantics of the second order lambda calculus
- scientific article; zbMATH DE number 2102746 (Why is no real title available?)
- Type inference with simple subtypes
- Baby Modula-3 and a theory of objects
- Categorical models for non-extensional λ-calculi and combinatory logic
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
- Modelling multiple inheritance with colimits
- scientific article; zbMATH DE number 2112161 (Why is no real title available?)
- Toward a semantics for the QUEST language
- Realisability semantics of parametric polymorphism, general references and recursive types
- Domain theoretic models of polymorphism
- Meta-circular interpreter for a strongly typed language
- Type classes with existential types
- scientific article; zbMATH DE number 4180813 (Why is no real title available?)
- Polymorphic lambda calculus and subtyping.
- Intersection and union types
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- The semantics of second-order lambda calculus
- Recursion over realizability structures
- Bunched polymorphism
- Contractive signatures with recursive types, type parameters, and abstract types
- Topological Completeness in an Ideal Model for Polymorphic Types
- Logic of subtyping
- Labelled reductions, runtime errors, and operational subsumption
- Subtyping constrained types
- Pebble, a kernel language for modules and abstract data types
- scientific article; zbMATH DE number 3938562 (Why is no real title available?)
- Recursive types for Fun
- Type inference, abstract interpretation and strictness analysis
- Adequacy for a lazy functional language with recursive and polymorphic types
- A coinductive completeness proof for the equivalence of recursive types
- Syntactic soundness proof of a type-and-capability system with hidden state
- A realizability interpretation for intersection and union types
- Simplifying subtyping constraints: a theory
- A semantics of multiple inheritance
- Programming Languages and Systems
- Elaborating intersection and union types
- FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES
- Combining type disciplines
- Semantic types: a fresh look at the ideal model for types
- Filter models with polymorphic types
- Polymorphic type inference and containment
- Intuitionistic fixed point logic
- Isomorphism of intersection and union types
- A record calculus with principal types
- Singleton, union and intersection types for program extraction
This page was built for publication: An ideal model for recursive polymorphic types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776602)
