Gradually typed languages allow statically typed and dynamically typed code to interact while maintaining benefits of both styles. The key to reasoning about about these mixed programs is Siek-Vitousek-Cimini-Boyland’s (dynamic) gradual guarantee, which says that giving one piece of a program a more precise type only adds runtime type checking, and does not otherwise change behavior. In this paper, we give a semantic reformulation of the gradual guarantee called graduality.
We change the name to promote the analogy that graduality is to gradual typing what parametricity is to polymorphism. Each gives a local-to-global, syntactic-to-semantic reasoning principle that is formulated in terms of a kind of observational approximation. Utilizing the analogy, we propose a novel logical relation for proving graduality.
Furthermore, we show that embedding-projection pairs (ep pairs) are to graduality what relations are to parametricity. We argue that casts between two types where one is “more dynamic” (less precise) than the other necessarily form an ep pair, and we use this to cleanly prove the graduality cases for casts from the ep-pair property. To construct ep pairs, we give an analysis of the type dynamism relation—also known as type precision or naïve subtyping—that interprets the rules for type dynamism as compositional constructions on ep pairs, analogous to the coercion interpretation of subtyping.
Wed 26 Sep
|13:00 - 13:22|
|13:22 - 13:45|
John Peter Campora IIIULL Lafayette, Sheng ChenUniversity of Louisiana at Lafayette, Eric WalkingshawOregon State UniversityDOI
|13:45 - 14:07|
|14:07 - 14:30|
Joachim BreitnerDFINITY Foundation, Antal Spector-Zabusky, Yao LiUniversity of Pennsylvania, Christine RizkallahUniversity of New South Wales, John WiegleyBAE Systems, Stephanie WeirichUniversity of Pennsylvania, USADOI