Haskell-style Overloading is NP-hard

Dennis M. Volpano. Haskell-style Overloading is NP-hard. In Henri E. Bal, editor, Proceedings of the IEEE Computer Society 1994 International Conference on Computer Languages, May 16-19, 1994, Toulouse, France. pages 88-94, IEEE Computer Society, 1994.

@inproceedings{Volpano94,
  title = {Haskell-style Overloading is NP-hard},
  author = {Dennis M. Volpano},
  year = {1994},
  tags = {Haskell},
  researchr = {https://researchr.org/publication/Volpano94},
  cites = {0},
  citedby = {0},
  pages = {88-94},
  booktitle = {Proceedings of the IEEE Computer Society 1994 International Conference on Computer Languages, May 16-19, 1994, Toulouse, France},
  editor = {Henri E. Bal},
  publisher = {IEEE Computer Society},
}