Scope graphs are a promising generic framework for modeling the binding structures of programming languages, briding formalization and implementation, supporting the definition of type checkers and the automation of type safety proofs. However, previous work on scope graphs has been limited to simple, nominal type systems. In this paper, we show that viewing scopes as types enables us to model the internal structure of types in a range of non-simple type systems (including structural records and generic classes) using the generic representation of scopes. Further, we show that relations between such types can be expressed in terms of generalized scope graph queries. We extend scope graphs with scoped relations and queries. We introduce Statix, a new domain-specific meta-language for the specification of static semantics, based on scope graphs and constraints. We evaluate the scopes as types approach and the Statix design in case studies of STLCREC, System F, and Featherweight Generic Java.
Wed 7 Nov
|10:30 - 10:52|
|10:52 - 11:15|
|Link to publication DOI Pre-print|
|11:15 - 11:37|
|11:37 - 12:00|
Hendrik van AntwerpenTU Delft, Casper Bach PoulsenDelft University of Technology, Arjen RouvoetDelft University of Technology, Eelco VisserDelft University of TechnologyLink to publication DOI File Attached