Untangling Typechecking of Intersections and Unions

@inproceedings{Dunfield2010UntanglingTO,
  title={Untangling Typechecking of Intersections and Unions},
  author={J. Dunfield},
  booktitle={ITRS},
  year={2010}
}
  • J. Dunfield
  • Published in ITRS 2010
  • Mathematics, Computer Science
  • Intersection and union types denote conjunctions and disjunctions of properties. Using bidirectional typechecking, intersection types are relatively straightforward, but union types present challenges. For union types, we can case-analyze a subterm of union type when it appears in evaluation position (replacing the subterm with a variable, and checking that term twice under appropriate assumptions). This technique preserves soundness in a call-by-value semantics. Sadly, there are so many… CONTINUE READING
    7 Citations

    References

    SHOWING 1-10 OF 30 REFERENCES
    Tridirectional typechecking
    • 85
    • PDF
    Type Assignment for Intersections and Unions in Call-by-Value Languages
    • 68
    • PDF
    Refined typechecking with Stardust
    • 37
    • PDF
    Intersection types and computational effects
    • 121
    • Highly Influential
    • PDF
    Strict bidirectional type checking
    • 21
    • PDF
    A unified system of type refinements
    • 64
    • PDF
    Greedy bidirectional polymorphism
    • 16
    • PDF
    Dependent types in practical programming
    • 605
    • PDF
    Local type inference
    • 371
    • PDF
    Is continuation-passing useful for data flow analysis?
    • 47