Our paper introduces a new expressive conditional syntax called Ultimate Conditional Syntax (hereinafter referred to as UCS). In the paper, we propose an algorithm to translate this syntax to traditional pattern matching and prove its correctness.
Our artifact implements this syntax and its translation algorithm on the MLscript compiler. The artifacts consists of two parts:
- The main project is a Scala project, which is a complete MLscript compiler, and includes the implementation and tests of UCS;
- The web demo provides a user-friendly interface, allowing people to compile and run MLscript (with UCS) programs directly in the browser, and view the results of each stage of the algorithm described in the paper.
The main project is the paper's main contribution, which fully implements the algorithm specified by the paper. The web demo illustrates the reusability of our main project: it can be reused by other programs (even in different programming languages).
For more instructions, including how to run the main project and web demo, please refer to the PDF documentation on the review platform.