Type-Checking Modules and Imports using Scope Graphs

Type-Checking Modules and Imports using Scope Graphs: A Case Study on a Language with Relative, Unordered and Glob Import Semantics

Hübner, Paul (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Programming Languages)

Poulsen, C.B. (mentor)
Zwaan, A.S. (mentor)
Durieux, T. (graduation committee)

Delft University of Technology

Computer Science and Engineering

CSE3000 Research Project

2023-06-29

Scope graphs provide a way to type-check real-world programming languages and their constructs. A previous implementation that type-checks the proof-of-concept language LM, a language with relative, unordered, and glob imports, does not halt. This thesis discusses a five-step approach for constructing and type-checking a scope graph of an LM program. Using manually scheduled queries and auxiliary algorithms, type-checking the majority of examples failing in previous literature succeeds. The introduction of breadth-first-traversal and multi-origin querying is discussed as new scope graph primitives to aid in the reusability of this thesis for type-checkers that require stratified resolution.

type-checking
scope graphs
relative imports
unordered imports
glob imports
lm
stratified

http://resolver.tudelft.nl/uuid:e7f16989-9aca-4707-9d4a-74eba2adc5e4

Student theses

bachelor thesis

© 2023 Paul Hübner