pattern-artifacts

This repo includes artifacts for "Live Pattern Matching with Typed Holes". Specifically,

Folder agda-mechanization contains a proof mechanization that concludes the type safety of the system presented in the paper.
Folder incon-sat contains a minimal implementation of exhaustiveness and redundancy checking based on SAT solving (as described in Sec 4.7.1 of the paper). Instead of type checking a program with holes, it simply focuses on checking consistency between constraints ξ, which resemble patterns p. The integration into Hazel can be found here, which implements the algorithm described in Sec 4.7.2 and the extension with finite labeled sums described in Sec 5 .

Kick The Tires

Assuming Agda 2.6.2(other version might also work) is installed, run $ agda all.agda under agda-mechanization will check the proof.
Assuming opam is installed, run $ ./build under incon-sat will build the project and check the tests.

Alternatively, you may use Docker. Note: building dockers may take a while.

Build and run Agda mechanization

$ docker pull pattern-agda
$ docker build -t pattern-agda agda-mechanization
$ docker run pattern-agda # will check proof

Build and run Exhaustiveness and Redundancy Checker

$ docker build -t pattern-incon incon-sat
$ docker run -it pattern-incon # will invoke OCaml toplevel

Pre-built dockers are available.

$ docker pull victoryuan/pattern-agda
$ docker pull victoryuan/pattern-incon

Please see the README in each folder for detailed instructions.