A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Parametric polymorphism and semantic subtyping
2011
Proceeding of the 16th ACM SIGPLAN international conference on Functional programming - ICFP '11
We consider a type algebra equipped with recursive, product, function, intersection, union, and complement types together with type variables and implicit universal quantification over them. We consider the subtyping relation recently defined by Castagna and Xu over such type expressions and show how this relation can be decided in EXPTIME, answering an open question. The novelty, originality and strength of our solution reside in introducing a logical modeling for the semantic subtyping
doi:10.1145/2034773.2034789
dblp:conf/icfp/GesbertGL11
fatcat:yoc2ewbxyvez7brjci67ppzqgy