Dependently Typed Languages in Statix
Jonathan Brouwer, Jesper Cockx, Aron Zwaan
Date: Wed, March 22, 2023
Room: Turing 0.E420
Static type systems can greatly enhance the quality of programs, but implementing a type checker that is both expressive and user-friendly 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 a type system. However, so far Statix has not been used to implement dependent types, which is a class of type systems which require evaluation of terms during type checking. In this paper, we present an implementation 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.
Danny Groenewegen, Elmer van Chastelet, Max de Krieger, Daniel A. A. Pelsmaeker | Eating Your Own Dog Food: WebDSL Case Studies to Improve Academic Workflows
Next: Douglas A. Creager, Hendrik van Antwerpen | Stack graphs: Name resolution at scale