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.

Abstract

Abstract is missing.