A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Subtyping of union types can be fairly complex due to interactions with function and pair types. Furthermore, this interaction turns out to depend on the calculus considered: for instance, a call-by-value calculus and a call-by-name calculus will have different possible subtyping rules. In order to abstract ourselves away from this dependence, we consider a fairly large family of calculi. We define types in a semantic fashion, as sets of terms. Then, a type can be a subtype of another type ifdoi:10.1007/978-3-540-30124-0_32 fatcat:bt3rw5o2vbd7vowo6snxnegdae