Dependently Typed Languages in Statix
Date: Wed, April 26, 2023
Room: Snijderszaal LB 01.010 (building 36)
Note: This is a Masters defense.
Static type systems can greatly enhance the quality of programs, but implementing a type checker for them is challenging and error-prone. The Statix meta-language (part of the Spoofax language workbench) aims to make this task easier by automatically deriving a type checker from a declarative specification of the type system. However, so far Statix has not been used to implement a type system with dependent types, an expressive class of type systems which require evaluation of terms during type checking.
In this thesis, we present a specification of a simple dependently typed language in Statix, and discuss how to extend it with several common features such as inductive data types, universes, and inference of implicit arguments. While we encountered some challenges in the implementation, our conclusion is that Statix is already usable as a tool for implementing dependent types.
| Dependently Typed Languages in Statix
Next: Aron Zwaan | Formalizing Access Modifiers using Scope Graphs: Ongoing Research Talk