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
This paper is a follow-up on previous work by the author on subtyping with (set-theoretic) union, intersection and recursive types. Previously, it was shown how types may be encoded as regular tree expressions/set constraints. This gave rise to a sound and complete decision procedure for type inclusion. The result was, however, limited to a rather speci c type language. In the work reported on here, we generalize the result and develop a general technique for deriving subtyping algorithms fordoi:10.1007/3-540-57887-0_121 fatcat:ftzqhqtasvgs3g5rbq6p4dth54