Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching

Neil Mitchell, Colin Runciman. Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching. In Andy Gill, editor, Proceedings of the 1st ACM SIGPLAN Symposium on Haskell, Haskell 2008, Victoria, BC, Canada, 25 September 2008. pages 49-60, ACM, 2008. [doi]

@inproceedings{MitchellR08,
  title = {Not all patterns, but enough: an automatic verifier for partial but sufficient pattern matching},
  author = {Neil Mitchell and Colin Runciman},
  year = {2008},
  doi = {10.1145/1411286.1411293},
  url = {http://doi.acm.org/10.1145/1411286.1411293},
  tags = {Haskell, pattern matching},
  researchr = {https://researchr.org/publication/MitchellR08},
  cites = {0},
  citedby = {0},
  pages = {49-60},
  booktitle = {Proceedings of the 1st ACM SIGPLAN Symposium on Haskell, Haskell 2008, Victoria, BC, Canada, 25 September 2008},
  editor = {Andy Gill},
  publisher = {ACM},
  isbn = {978-1-60558-064-7},
}