A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf
.
On the power of coercion abstraction
2012
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12
Erasable coercions in System F η , also known as retyping functions, are well-typed η-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in F η can model subtyping of known types and some displacement of quantiers, but not subtyping assumptions nor certain forms of delayed type instantiation. We generalize F η by allowing abstraction over retyping functions. We follow a general approach where computing
doi:10.1145/2103656.2103699
dblp:conf/popl/CretinR12
fatcat:gtd47sxwefgsrkmnpr6a4llt4q