On understanding types, data abstraction, and polymorphism
ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Polymorphic type inference for languages with overloading and subtyping
Polymorphic type inference for languages with overloading and subtyping
Efficient inference of partial types
Journal of Computer and System Sciences
Principal type schemes for functional programs with overloading and subtyping
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
A calculus for overloaded functions with subtyping
Information and Computation
Lower bounds on type checking overloading
Information Processing Letters
On the Complexity of ML Typability with Overloading
Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraint-set satisfiability for overloading
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Facilitating reuse in hardware models with enhanced type inference
Proceedings of the 2nd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Matlab Guide
Metamodeling-Driven IP Reuse for SoC Integration and Microprocessor Design
Metamodeling-Driven IP Reuse for SoC Integration and Microprocessor Design
| Hi-index | 0.00 |
We show that overloading is NP-complete. This solves exercise 6.25 in the 1986 version of the Dragon book.