Mark P. Jones
- 1.H. Barendregt. Introduction to generalized type systems. Journal of Functional Programming, volume 1, part 2, 1991.Google Scholar
Cross Ref
- 2.V. Breazu-Tannen, T. Coquand, C.A. Gunter and A. Scedrov. Inheritance and coercion. In {EEE Symposium on Logic in Computer Science, 1989. Google ScholarDigital Library
- 3.K. Chen, P. Hudak, and M. Odersky. Parametric type classes (Extended abstract). A CM conference on LISP and Functional Programming, San Francisco, Califorvia, June 1992. Google ScholarDigital Library
- 4.L. Damas and R. Milner. Principal type schemes for functional programs, in 8th Annual A CM Symposium on Principles of Programming languages, 1982. Google ScholarDigital Library
- 5.P. Hudak and J. Fasel. A gentle introduction to Haskell. A CM SIGPLAN notices, 27, 5, May 1992. Google ScholarDigital Library
- 6.P. Hudak, S.L. Peyton Jones and P. Wadler (eds.). Report on the programming language Haskell, version 1.2. A CM SIGPLAN notices, 27, 5, May 1992. Google ScholarDigital Library
- 7.M.P. Jones. A theory of qualified types. In European symposium on programming. Springer Verlag LNCS 582, 1992. Google ScholarDigital Library
- 8.M.P. Jones. Qualified types: Theory and Practice. D. Phil. Thesis. Programming Research Group, Oxford University Computing Laboratory. July 1992. Google ScholarDigital Library
- 9.M.P. Jones. Programming with constructor classes (preliminary summary). In Draft Proceedings of the Fifth Annual Glasgow Workshop on Functional Programming, Ayr, Scotland, July 1992. Google ScholarDigital Library
- 10.E. Moggi. Computational lambda-calculus and monads. IEEE Symposium on Logic in Computer Science, Asilomar, California, June 1989. Google ScholarDigital Library
- 11.J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the A CM, 12, 1965. Google ScholarDigital Library
- 12.M. Spivey. A functional theory of exceptions. Science of Computer Programming, 14(1), June 1990. Google ScholarDigital Library
- 13.P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In 16th A CM ann~ual symposium on Principles of Programming Languages, Austin, Texas, January 1989. Google ScholarDigital Library
- 14.P. Wadler. Comprehending Monads. A CM conference on LISP and Functional Programming, Nice, France, June 1990. Google ScholarDigital Library
- 15.P. Wadler. The essence of functional programming. In 19th Annual Symposium on Principles of Programming Languages, Santa Fe, New Mexico, January 1992. Google ScholarDigital Library
Index Terms
- A system of constructor classes: overloading and implicit higher-order polymorphism
Recommendations
Zero-Cost Constructor Subtyping
IFL '20: Proceedings of the 32nd Symposium on Implementation and Application of Functional LanguagesConstructor subtyping is a form of subtyping where two inductive types can be related as long as the inductive signature of one is a subsignature of the other. To be a subsignature requires every constructor of the smaller datatype be present in the ...
Free theorems involving type constructor classes: functional pearl
ICFP '09Free theorems are a charm, allowing the derivation of useful statements about programs from their (polymorphic) types alone. We show how to reap such theorems not only from polymorphism over ordinary types, but also from polymorphism over type ...
Free theorems involving type constructor classes: functional pearl
ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programmingFree theorems are a charm, allowing the derivation of useful statements about programs from their (polymorphic) types alone. We show how to reap such theorems not only from polymorphism over ordinary types, but also from polymorphism over type ...
Reviews
Edward A. Schneider
Jones presents an important extension to type classes as found in the applicative programming language Haskell. Type classes are a set of types to which a group of polymorphic functions may be applied; they provide a means to control ad hoc polymorphism. The extension presented in this paper generalizes a class to consist of constructed types, possibly containing one or more type variables (such as LIST * ). Thus, map can be defined not only over lists, but over trees and other types. This extension seems to be motivated by the desire to define monads in applicative languages, and an extensive example of the definition of monads using extended type classes is presented. Following this example, the author gives a formal treatment of extended type classes as kinds and presents an algorithm for implicitly inferring the kind of a type class expression. An implementation of these type classes is available for experimentation in Gofer, a Haskell relative. The paper is easy to understand, although some knowledge of type classes and monads would be helpful. I recommend it for anyone interested in applicative languages and their typing.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments