University of Maryland, College Park
4:30pm Tuesday, 12th of May, 2009
Room 4.31/4.33, Informatics Forum
A number of important program rewriting scenarios can be recast as type-directed coercion insertion. These range from more theoretical applications such as coercive subtyping and supporting overloading in type theories, to more practical applications such as integrating static and dynamically typed code using gradual typing, and inlining code to enforce security policies such as access control and provenance tracking. In this talk I will present a general theory of type-directed coercion insertion based on generating and inserting coercions. This theory permits exploring the inherent tradeoff between expressiveness and ambiguity---the more powerful the strategy for generating coercions, the greater the possibility of several, semantically distinct rewritings for a given program. I consider increasingly powerful coercion generation strategies, work out example applications supported by the increased power (including those mentioned above), and identify the inherent ambiguity problems of each setting, along with various techniques to tame the ambiguities.
This is joint work with Gavin Bierman and Nikhil Swamy, both at Microsoft Research.