Intersection types and computational effects
From MaRDI portal
Publication:2943370
DOI10.1145/351240.351259zbMATH Open1321.68147OpenAlexW2128529251MaRDI QIDQ2943370FDOQ2943370
Authors: Rowan Davies, Frank Pfenning 
Publication date: 11 September 2015
Published in: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/351240.351259
Recommendations
Cited In (21)
- Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
- Taming the Merge Operator
- Disjoint Polymorphism
- A calculus with recursive types, record concatenation and subtyping
- Title not available (Why is that?)
- Intersection type assignment systems
- Termination checking with types
- Intersection types in Java: back to the future
- Polarized subtyping
- Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
- Intersection, Universally Quantified, and Reference Types
- Implementing compositional analysis using intersection types with expansion variables
- Quantitative global memory
- Intersection types and overloading
- Disjoint intersection types
- Extensible Datasort Refinements
- Judgmental subtyping systems with intersection types and modal types
- Applicative intersection types
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- On the unity of duality
Uses Software
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)
