A Monadic Framework for Name Resolution in Multi-phased Type Checkers

An important aspect of type checking is name resolution — i.e., determining the types of names by resolving them to a matching declaration. For most languages, we can give typing rules that define name resolution in a way that abstracts from what order different units of code should be checked in. However, implementations of type checkers in...

Using Spoofax to Support Online Code Navigation

Spoofax is a language workbench. A Spoofax language specification generally includes name resolution: the analysis of bindings between definitions and references. When browsing code in the specified language using Spoofax, the bindings appear as hyperlinks, supporting precise name-based code navigation. However, Spoofax cannot be used for...

Scope states: Guarding safety of name resolution in parallel type checkers

Compilers that can type check compilation units in parallel can make more efficient use of multi-core architectures, which are nowadays widespread. Developing parallel type checker implementations is complicated by the need to handle concurrency and synchronization of parallel compilation units. Dependencies between compilation units are...

The semantics of name resolution in Grace

Grace is a dynamic object oriented programming language<br/>designed to aid programming education. We present a formal<br/>model of and give an operational semantics for its object<br/>model and name resolution algorithm. Our main contributions <br/>are a systematic model of Grace’s name resolution using<br/>scope graphs, relating linguistic...

A Constraint-based Approach to Name Binding and Type Checking using Scope Graphs

Recently scope graphs were introduced as a formalism to specify the name binding structure of a program and do name resolution independent of the abstract syntax tree of a program. In this thesis we show how to use a constraint language based on scope graphs to do static analysis of programs. We do this by extracting constraints from a program,...

Language-Parametric Incremental and Parallel Name Resolution

Static analyses and transformations are an important part of programming and domain specific languages. For example; integrated development environments analyze programs for semantic errors such as incorrect names or types to warn the programmer about these errors. Compilers translate high-level programs into programs of another language or...