Incremental Type-Checking for Free: Artifact

Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-checking can provide that in a scalable fashion. However, existing techniques are not reusable between languages. Moreover, mutual and dynamic dependencies preclude traditional approaches to incrementality. This makes finding automatic approaches to incremental type-checking a challenging but important open question.

In this paper, we present a technique to automatically derive incremental type-checkers from Statix specifications. We use name resolution queries in scope graphs (a generic representation of name resolution embedded in Statix) to derive dependencies between compilation units. A novel query confirmation algorithm finds queries for which the answer changed due to an edit in the program. Only units with such queries require reanalysis.

The effectiveness of this algorithm is improved by

1. splitting the type-checking task into a context-free and a context-sensitive part, and
2. reusing a generic mechanism to resolve mutual dependencies.

This automatically yields incremental type-checkers for any Statix specification.

Compared to non-incremental parallel execution, we achieve speedups up to 147x on synthetic benchmarks, and up to 21x on real-world projects, with initial overheads below 10%. This suggests that our framework can provide efficient incremental type-checking to the wide range of languages supported by Statix.