Intersection types and computational effects
From MaRDI portal
Recommendations
Cited in
(27)- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- A calculus with recursive types, record concatenation and subtyping
- scientific article; zbMATH DE number 6744146 (Why is no real title available?)
- Intersection type assignment systems
- Termination checking with types
- Intersection types in Java: back to the future
- Polarized subtyping
- Elaborating intersection and union types
- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
- Intersection, Universally Quantified, and Reference Types
- Taming the merge operator
- Implementing compositional analysis using intersection types with expansion variables
- Quantitative global memory
- Intersection types and overloading
- Disjoint intersection types
- Extensible Datasort Refinements
- Elaborating intersection and union types
- Judgmental subtyping systems with intersection types and modal types
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- Applicative intersection types
- Annotations for intersection typechecking
- A quantitative approach to global state composition
- Disjoint polymorphism
- Intersection types for a computational lambda-calculus with global state
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- On the unity of duality
- Subtyping and intersection types revisited
This page was built for publication: Intersection types and computational effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943370)
