SPLASH 2021 (series) / DLS 2021 (series) / Dynamic Languages Symposium / Union and Intersection Contracts Are Hard, Actually
Union and Intersection Contracts Are Hard, ActuallyResearch PaperVirtual
Tue 19 Oct 2021 07:50 - 08:15 at Zurich C - DLS Talks 2
Tue 19 Oct 2021 15:50 - 16:15 at Zurich C - DLS Talks 2 Chair(s): Arjun Guha
Tue 19 Oct 2021 15:50 - 16:15 at Zurich C - DLS Talks 2 Chair(s): Arjun Guha
Union and intersection types are a staple of gradually typed languages such as TypeScript. While it's long been recognized that union and intersection types are difficult to verify statically, it may appear at first that the dynamic part of gradual typing is actually pretty simple.
It turns out however, that in presence of higher-order contracts union and intersection are deceptively difficult. The literature on higher-order contracts with union and intersection, while keenly aware of the fact, doesn't really explain why. We point and illustrate the problems and trade-offs inherent to union and intersection contracts, via example and a survey of the literature.
Tue 19 OctDisplayed time zone: Central Time (US & Canada) change
Tue 19 Oct
Displayed time zone: Central Time (US & Canada) change
07:40 - 09:00 | |||
07:40 10mDay opening | Chair's Welcome and Most Notable Paper AwardVirtual DLS 2021 | ||
07:50 25mPaper | Union and Intersection Contracts Are Hard, ActuallyResearch PaperVirtual DLS 2021 DOI | ||
08:15 25mPaper | Runtime and Compiler Support for HAMTsResearch PaperVirtual DLS 2021 DOI |
15:40 - 17:00 | |||
15:40 10mDay opening | Chair's Welcome and Most Notable Paper AwardVirtual DLS 2021 | ||
15:50 25mPaper | Union and Intersection Contracts Are Hard, ActuallyResearch PaperVirtual DLS 2021 DOI | ||
16:15 25mPaper | Runtime and Compiler Support for HAMTsResearch PaperVirtual DLS 2021 DOI |