Untangling Typechecking of Intersections and Unions
@inproceedings{Dunfield2010UntanglingTO, title={Untangling Typechecking of Intersections and Unions}, author={J. Dunfield}, booktitle={ITRS}, year={2010} }
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
Union, intersection and refinement types and reasoning about type disjointness for secure protocol implementations
- Computer Science
- J. Comput. Secur.
- 2014
- 15
- PDF
Union, intersection, and refinement types and reasoning about type disjointness for security protocol analysis
- Computer Science, Mathematics
- 2012
- 4
- PDF
References
SHOWING 1-10 OF 30 REFERENCES
Type Assignment for Intersections and Unions in Call-by-Value Languages
- Computer Science
- FoSSaCS
- 2003
- 68
- PDF