Elaborating intersection and union types

DOI10.1145/2364527.2364534zbMath1291.68140arXiv1206.5386OpenAlexW2092120865MaRDI QIDQ5168879

Joshua Dunfield

Publication date: 21 July 2014

Published in: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.5386

zbMATH Keywords

intersection types

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

A Realizability Interpretation for Intersection and Union Types ⋮ Patterns in Knot Cohomology, I ⋮ Type inference for rank-2 intersection types using set unification ⋮ Structural rules and algebraic properties of intersection types ⋮ Disjoint Polymorphism ⋮ Man and machine thinking about the smooth 4-dimensional Poincaré conjecture

Uses Software

• Twelf
• Forsythe

This page was built for publication: Elaborating intersection and union types