Disjoint polymorphism
From MaRDI portal
Recommendations
Cites work
- A calculus for overloaded functions with subtyping
- A Declarative Language for the Coq Proof Assistant
- An algebraic approach to mixins and modularity
- An extension of system \(F\) with subtyping
- Disjoint intersection types
- Elaborating intersection and union types
- Engineering formal metatheory
- Extensible programming with first-class cases
- Functional Characters of Solvable Terms
- scientific article; zbMATH DE number 4180773 (Why is no real title available?)
- scientific article; zbMATH DE number 4051569 (Why is no real title available?)
- scientific article; zbMATH DE number 954811 (Why is no real title available?)
- scientific article; zbMATH DE number 814797 (Why is no real title available?)
- scientific article; zbMATH DE number 814798 (Why is no real title available?)
- Intersection types and computational effects
- Operations on records
- Polymorphic functions with set-theoretic types. I: Syntax, semantics, and evaluation
- Qualified Types
- Simple type-theoretic foundations for object-oriented programming
- The coherence of languages with intersection types
- Type inference, principal typings, and let-polymorphism for first-class mixin modules
- Types for Proofs and Programs
Cited in
(7)- Polymorphism and apartness
- Pre-grammars and inhabitation for a subset of rank 2 intersection types
- Disjoint bases in a polymatroid
- Taming the merge operator
- Distributive disjoint polymorphism for compositional programming
- Applicative intersection types
- A calculus with recursive types, record concatenation and subtyping
This page was built for publication: Disjoint polymorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988630)