Scope graphs are a promising generic framework to model the binding structures of programming languages, bridging 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,...
AbstractConstrained genericity is an extension of parametric polymorphism, that allows type paramete...
Compilers that can type check compilation units in parallel can make more efficient use of multi-cor...
We extend and combine two existing declarative formalisms, the scope graphs of Neron et al. and type...
Scope graphs are a promising generic framework to model the binding structures of programming langua...
Static name binding (i.e., associating references with appropriate declarations) is an essential asp...
Traditional type-checking programs are typically designed for specific programming languages, re- su...
Recently scope graphs were introduced as a formalism to specify the name binding structure of a prog...
This paper investigates the viability of using scope graphs to implement type checkers for programmi...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
Almost every programming language’s syntax includes a notion of binder and corresponding bound occur...
The syntax of almost every programming language includes a notion of binder and corresponding bound ...
Almost every programming language’s syntax includes a notion of binder and corresponding bound occur...
Scope graphs provide a way to type-check real-world programming languages and their constructs. A pr...
AbstractConstrained genericity is an extension of parametric polymorphism, that allows type paramete...
Compilers that can type check compilation units in parallel can make more efficient use of multi-cor...
We extend and combine two existing declarative formalisms, the scope graphs of Neron et al. and type...
Scope graphs are a promising generic framework to model the binding structures of programming langua...
Static name binding (i.e., associating references with appropriate declarations) is an essential asp...
Traditional type-checking programs are typically designed for specific programming languages, re- su...
Recently scope graphs were introduced as a formalism to specify the name binding structure of a prog...
This paper investigates the viability of using scope graphs to implement type checkers for programmi...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
In previous work, we introduced scope graphs as a formalism for describing program binding structure...
Almost every programming language’s syntax includes a notion of binder and corresponding bound occur...
The syntax of almost every programming language includes a notion of binder and corresponding bound ...
Almost every programming language’s syntax includes a notion of binder and corresponding bound occur...
Scope graphs provide a way to type-check real-world programming languages and their constructs. A pr...
AbstractConstrained genericity is an extension of parametric polymorphism, that allows type paramete...
Compilers that can type check compilation units in parallel can make more efficient use of multi-cor...
We extend and combine two existing declarative formalisms, the scope graphs of Neron et al. and type...