+- 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](https://hazel.org/) can be found [here](https://github.com/hazelgrove/hazel/tree/adts-plus-match), which [implements](https://github.com/hazelgrove/hazel/blob/adts-plus-match/src/hazelcore/Incon.re) the algorithm described in Sec 4.7.2 and the extension with finite labeled sums described in Sec 5 .
0 commit comments