… approaches to union types are untagged and tagged unions, which … interpretation to
understand gradual typing, we present a novel design for union types, called gradual union types…

… The code above shows that the use of union types fixes the shortcoming we pointed out. …
(the reason is that we could neither conceive any reasonable interpretation for a type such as ł¬ …

… gradual language that combines both gradual unions and the traditional, totally-unknown
type… we combine the classic set interpretation and the union interpretation, named the stratified …

… to a gradual interpretation of union types based on the design of Gradual Union Types through
… This contributes to understand the abstraction and reasoning behind Gradual Typing in …

… We define a new, more semantic interpretation of gradual types … the new interpretation to
define three gradual type systems … (as it was with the previous definition), since the union type …

… We propose Gradual GV as a gradually typed extension of the functional session type system
GV. Following a standard framework of gradual typing, Gradual GV consists of an external …

… To facilitate the explanation and implementation of intersection and union contracts we
dissect … When referring to union types we mean untagged unions, or “true” unions, rather than …

… types. As another example, we show that gradual upcasts are pure functions and, dually,
gradual … Next, we show several possible interpretations of the dynamic type that will all give, by …

… When a program is mostly static, it would be beneficial to instead interpret variables without
… Once the algorithm terminates, we read off the answer based on the stype and the union-find …

… , union types can be used to give a very precise type to a … interpretation of gradual types,
which allow us to derive some very powerful results about the representation of gradual types. …