Codebase Underlying the BSc Thesis: Type-Checking Modules and Imports using Scope Graphs
The objective of this research was to determine whether a stratified type-checking approach using scope graphs could type-check the proof-of-concept language LM. Scope graphs provide a way to type-check real-world programming languages and their constructs. Previous implementations that type-check LM, a language with relative, unordered, and glob imports, do not halt. This dataset contains Haskell code for constructing and type-checking a scope graph of an LM program. It is based on the Phased Haskell library. With this implementation, the all test cases halt and the majority exhibit the correct behaviour with only one false-negative. This implementation uses a five-step approach: Constructing a module hierarchy.Constructing a scope graph consisting of scopes and module sinks.Iteratively resolving imports and placing import edges in the scope graph.Adding all declarations of all modules to the scope graph.Type-checking the bodies of all declarations with respect to the scope graph. Many test cases bundled with this data set are based on those for LMR (which is very similar to LM) and can be found here. On top of that. more test cases were derived and included. All test cases are denoted as annotated terms. This data set is linked to a Bachelor's thesis completed at the EEMCS faculty at the TU Delft. A link will be added after publication.