A system of constructor classes: Overloading and implicit higher-order polymorphism

Journal of Functional Programming

Volumn 5, Issue 1, 1995, Pages 1-35

  Jnies, Mark ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959654733     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796800001210     Document Type: Article

References (23)

1. Barendregt, H. (1991) Introduction to generalized type systems. Journal of Functional Programming, 1(2).
2. Breazu-Tannen, V., Coquand, T., Gunter, C. A. and Scedrov, A. (1989) Inheritance and coercion. IEEE Symposium on Logic in Computer Science.
3. Chen, K., Hudak, P. and Odersky, M. (1992) Parametric type classes (Extended abstract). ACM Conf. LISP and Functional Programming, San Francisco, CA, June.
4. Damas, L. and Milner, R. (1982) Principal type schemes for functional programs. 8th Ann. ACM Symposium on Principles of Programming languages.
5. Hudak, P. and Fasel, J. (1992) A gentle introduction to Haskell. ACM SIGPLAN Notices, 27(5).
6. Hudak, P. Peyton Jones, S. L. and Wadler, P. (eds.) (1992) Report on the programming language Haskell, version 1.2. ACM SIGPLAN Notices, 27(5).
7. Jones, M. P. (1991) Introduction to Gofer—included as part of the Gofer distribution, available by anonymous ftp from nebula. cs. yale. edu in the directory pub/haske 11/gofer.
8. Jones, M. P. (1992a) A theory of qualified types. European symposium on programming. Lecture Notes in Computer Science 582. Springer-Verlag.
9. Jones, M. P. (1992b) Qualified types: Theory and Practice. DPhil thesis, Oxford University Computing Laboratory.
10. Jones, M. P. (1992c) Programming with constructor classes (preliminary summary). Proc. Fifth Annual Glasgow Workshop on Functional Programming, Ayr, Scotland. Springer-Verlag.
11. Jones, M. P. and Duponcheel, L. (1993) Composing Monads. Yale University, Department of Computer Science, Research Report YALEU/DCS/RR 1004.
12. King, D. J. and Wadler, P. (1992) Combining monads. Proc. Fifth Annual Glasgow Workshop on Functional Programming, Ayr, Scotland. Springer-Verlag.
13. MacLane, S. (1971) Categories for the working mathematician. Graduate Texts in Mathematics 5. Springer-Verlag.
14. MacQueen, D. B. (1984) Modules for Standard ML. Conf Record 1984 ACM Symposium on Lisp and Functional Programming.
15. Milner, R. (1978) A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3).
16. Milner, R., Tofte, M. and Harper, R. (1990) The definition of Standard ML. MIT Press.
17. Moggi, E. (1989) Computational lambda-calculus and monads. IEEE Symposium on Logic in Computer Science, Asilomar, CA.
18. Robinson, J. A. (1965) A machine-oriented logic based on the resolution principle. Journal ACM, 12.
19. Spivey, M. (1990) A functional theory of exceptions. Science of Computer Programming, 14(1).
20. Steele, G. L., Jr. (1994) Building interpreters by composing monads. 21st Ann. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, Oregon.
21. Wadler, P. and Blott, S. (1989) How to make ad-hoc polymorphism less ad-hoc. 16th Ann. ACM Symposium on Principles of Programming Languages, Austin, TX.
22. Wadler, P. (1990) Comprehending Monads. ACM Conf. LISP and Functional Programming, Nice, France.
23. Wadler, P. (1992) The essence of functional programming. 19th Ann. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Santa Fe, NM.