Extensible compiler design with abstract interpreters.
This project started off as an experiment in compiler design. Specifically, the author was motivated by:
- studying the Julia language and compiler inference system to understand language design with extensible abstract interpretation as a compiler (and potentially language!) feature.
- studying MLIR and the powerful ideas for IR and compiler design which are emerging from the project.
It turns out that there are quite a few of languages (e.g. Crystal, Nim, Julia) experimenting with abstract interpretation as part of their type systems. In the long term, the goal of the project might be to provide a stable substrate to experiment on compiler design cons abstract interpreters inside of an IR framework which supports MLIR-like extensibility concepts.
The framework provides:
- An intermediate representation with concepts isomorphic to MLIR.
- Interfaces for defining interpreters which act as abstract virtual machines on the IR, as well as reference (usable!) interpreters for standard design patterns.
- Builder interfaces which support code generation to MLIR.
"Extensibility" means that there are no fixed intrinsics built into the IR (or any of the interfaces). The same is true for abstract lattices -- the interpreter patterns describe how (certain instances) of abstract interpreters will traverse the IR, but the user must provide the semantics by specifying intrinsics and how the interpreter should interpret the intrinsics on a user-defined lattice.
Note:
The original author would have liked to just do this in MLIR proper -- but given time constraints and engineering ability (or lack thereof in C++), this project is implemented in Rust. In fact, for those interested in MLIR -- you may find "another implementation viewpoint" useful on the design concepts. The codebase has been documented with respect to non-trivial implementation decisions and their motivation from MLIR.