Intersection types and computational effects

DOI10.1145/351240.351259zbMath1321.68147OpenAlexW2128529251MaRDI QIDQ2943370

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

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18)

Related Items (14)

From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ Polarized subtyping ⋮ Applicative intersection types ⋮ A calculus with recursive types, record concatenation and subtyping ⋮ Quantitative global memory ⋮ Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\) ⋮ The untyped computational \(\lambda \)-calculus and its intersection type discipline ⋮ Disjoint Polymorphism ⋮ Extensible Datasort Refinements ⋮ Termination checking with types ⋮ On the unity of duality ⋮ Judgmental subtyping systems with intersection types and modal types ⋮ Intersection, Universally Quantified, and Reference Types ⋮ Taming the Merge Operator

Uses Software

• ML

This page was built for publication: Intersection types and computational effects