Decidable, Tag-Based Semantic Subtyping for Nominal Types, Tuples, and Unions
Semantic subtyping enables simple, set-theoretical reasoning about types by interpreting a type as the set of its values. Previously, semantic subtyping has been studied primarily in the context of statically typed languages with structural typing. In this paper, we explore the applicability of semantic subtyping in the context of a dynamic language with nominal types. Instead of static type checking, dynamic languages rely on run-time checking of type tags associated with values, so we propose using the tags for semantic subtyping. We base our work on a fragment of the Julia language and present tag-based semantic subtyping for nominal types, tuples, and unions, where types are interpreted set-theoretically as sets of type tags. The proposed subtyping relation is shown to be decidable, and a corresponding analytic definition is provided. The implications of using semantic subtyping for multiple dispatch are also discussed.
Sep 2018: PhD Student, Northeastern University, USA.
Sep 2017 – Jul 2018: Researcher, Czech Technical University in Prague, Czech Republic.
Jan 2017 – Jun 2017: Research Scientist, Northeastern University, USA.
2014–2016: teaching assistant/lecturer at Southern Federal University, Russia.
Received MS in Computer Science from Southern Federal University, Russia in 2014.
Mon 15 Jul
|13:30 - 14:30|
Scott OwensUniversity of Kent, UK
|14:30 - 15:00|
Julia BelyakovaNortheastern University, USADOI Pre-print