Type classes with more higher-order polymorphism
- 17 September 2002
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 37 (9) , 179-190
- https://doi.org/10.1145/581478.581496
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- Kinded type inference for parameteric overloadingActa Informatica, 1996
- A system of constructor classesPublished by Association for Computing Machinery (ACM) ,1993
- Unification under a mixed prefixJournal of Symbolic Computation, 1992
- On the existence of speed-independent circuitsTheoretical Computer Science, 1991
- A second-order pattern matching algorithm for the cube of typed λ-calculiLecture Notes in Computer Science, 1991
- A unification algorithm for second-order monadic termsAnnals of Pure and Applied Logic, 1988
- Parametric overloading in polymorphic programming languagesPublished by Springer Nature ,1988
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- A unification algorithm for typed