Supplementary material of submission "A verified algorithm for deciding pattern completeness with optimal asymptotic complexity"

Haskell
- Haskell source of our verified decision procedure
- Haskell source of term-rewriting library (used by FORT-h)
- Haskell source of FORT-h 
- Haskell source for tree automata encoding
- setup to run experiments OUR | GHC | TA | NEW | FSCD
- see Readme.txt in subdirectory for further details

SML
- SML source of our verified decision procedure
- SML source of AGCP 
- setup to run experiments COMP 
- see Readme.txt in subdirectory for further details

results
- directory will be filled when running some experiments
