ACM Transactions on Programming Languages and Systems (TOPLAS)
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
The C++ programming language
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Polymorphic type inference and containment
Information and Computation - Semantics of Data Types
Type inference in the presence of type abstraction
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Type reconstruction with first-class polymorphic values
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
How to make ad-hoc polymorphism less ad hoc
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Object-oriented software construction (2nd ed.)
Object-oriented software construction (2nd ed.)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Parametric Overloading in Polymorphic Programming Languages
ESOP '88 Proceedings of the 2nd European Symposium on Programming
Towards a theory of type structure
Programming Symposium, Proceedings Colloque sur la Programmation
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
ACM SIGPLAN Notices
Automatic instantiation in Ada
TRI-Ada '91 Proceedings of the conference on TRI-Ada '91: today's accomplishments; tomorrow's expectations
On generic formal package parameters in Ada 9X
ACM SIGAda Ada Letters
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type-checking multi-parameter type classes
Journal of Functional Programming
| Hi-index | 0.00 |
An algorithm is presented to infer the type and operation parameters of polymorphic functions. Operation parameters are named and typed at the function definition, but are selected from the set of overloaded definitions available wherever the function is used. These parameters are always implicit, implying that the complexity of using a function does not increase with the generality of its type.