Parametric type classes
- 1 January 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- No. 1,p. 170-181
- https://doi.org/10.1145/141471.141536
Abstract
We propose a generalization to Haskell's type classes where a class can have type parameters besides the placeholder variable. We show that this generalization is essential to represent container classes with overloaded data constructor and selector operations. We also show that the resulting type system has principal types and present unification and type reconstruction algorithms.Keywords
This publication has 10 references indexed in Scilit:
- Comprehending monadsPublished by Association for Computing Machinery (ACM) ,1990
- Interactive type analysis and extended message splitting; optimizing dynamically-typed object-oriented programsPublished by Association for Computing Machinery (ACM) ,1990
- Safe run-time overloadingPublished by Association for Computing Machinery (ACM) ,1990
- Order-sorted unificationJournal of Symbolic Computation, 1989
- How to make ad-hoc polymorphism less ad hocPublished by Association for Computing Machinery (ACM) ,1989
- F-bounded polymorphism for object-oriented programmingPublished by Association for Computing Machinery (ACM) ,1989
- Parametric overloading in polymorphic programming languagesPublished by Springer Nature ,1988
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- A language for computational algebraPublished by Association for Computing Machinery (ACM) ,1981
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965