A theory of overloading

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2002, Pages 167-178

  Stuckey, Peter J ^a   Sulzmann, Martin ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Constraints; Overloading; Type classes; Type inference

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; INFERENCE ENGINES; LOGIC PROGRAMMING; SEMANTICS;

CONSTRAINT HANDLING RULES; OVERLOADING; POLYMORPHISM;

PROGRAMMING THEORY;

EID: 0036949278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/581478.581495     Document Type: Conference Paper

References (36)

1. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proc. of CP'97, LNCS 1330, pages 252-266. Springer-Verlag, 1997.
2. V: A flexible query language. In Proc. of Flexible Query Answering Systems, LNAI 1495, pages 1-14. Springer-Verlag, 1998.
3. Lennart Augustsson. Cayenne - a language with dependent types. In Proc. of ICFP'98, pages 239-250. ACM Press, 1998.
4. C. Camarao and L. Figueiredo. Type inference for over-loading without restrictions, declarations or annotations. In Proc. of the 4th Fuji International Symposium on Functional and Logic Programming, LNCS 1722, pages 37-52, Springer-Verlag, 1999.
5. K. Chen, P. Hudak, and M. Odersky. Parametric type classes. In Proc. of ACM Conf. on Lisp and Functional Programming, pages 170-191. ACM Press, 1992.
6. B. Demoen, M. García de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In Proc. of CP'99, LNCS 1713, pages 174-188. Springer-Verlag, 1999.
7. T. Frühwirth. Constraint handling rules. In Constraint Programming: Basics and Trends, LNCS 910. Springer-Verlag, 1995.
8. T. Frühwirth. A declarative language for constraint systems: Theory and practice of constraint handling rules, 1998. Habilitation.
9. T. Frühwith. Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1-3):95-138, 1998.
10. M. Gasbichler, M. Neubauer, M. Sperber, and P. Thiemann. Functional logic overloading. In Proc. of POPL'02, pages 233-244. ACM Press, 2002.
11. K. Glynn, P. Stuckey, and M. Sulzmann. Type classes and constraint handling rules. First Workshop on Rule-Based Constraint Reasoning and Programming, July 2000. CORR http://xxx.lanl.gov/abs/cs.PL/0006034.
12. M. Hanus. The integration of functions into logic programming: From theory to practice. Journal of Logic Programming, 19&20:583-628, 1994.
13. The Mercury language reference manual, 2001, http://www.cs.mu.oz.au/research/mercury/.
14. D. Jeffrey, F. Henderson, and Z. Somogyi. Type classes in Mercury. In Proc. of 23rd Australasian Computer Science Conf., pages 128-135. IEEE Press, 2000.
15. M. P. Jones, Qualified Types: Theory and Practice. D.phil. thesis, Oxford University, September 1992.
16. M. P. Jones. Coherence for qualified types. Research Report YALEU/DCS/RR-989, Yale University, Department of Computer Science, September 1993.
17. M. P. Jones. A system of constructor classes: Overloading and implicit high-order polymorphism. In Proc. of FPCA '93, pages 52-61, ACM Press, 1993.
18. M. P. Jones. Simplifying and improving qualified types. In Proc. of FPCA '95, pages 160-169. ACM Press, 1995.
19. M. P. Jones. Type classes with functional dependencies. In Proc. of ESOP'00, pages 230-234 LNCS 1782. Springer-Verlag, 2000.
20. S. Peyton Jones, M. P. Jones, and E. Meijer. Type classes: an exploration of the design space. In Haskell Workshop, June 1997.
21. S. Kaes. Parametric overloading in polymorphic programming languages. In Proc. of ESOP'88, LNCS 300, pages 131-141. Springer-Verlag, 1988.
22. J. Lewis, M. Shields, E. Meijer, and J. Launchbury. Implicit parameters: Dynamic scoping with static types. In Proc. of POPL'00, pages 108-118. ACM Press, 2000.
23. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, Dec 1978.
24. T. Nipkow and C. Prehofer. Type reconstruction for type classes. Journal of Functional Programming, 5(2):201-224, 1995.
25. M. Odersky, M. Sulzmann, and M. Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35-55, 1999.
26. M. Odersky, P. Wadler, and M. Wehr. A second look at over-loading. In Proc. of FPCA'95, pages 135-146. ACM Press, 1995.
27. S. Peyton Jones et al. Report on the programming language Haskell 98. http://haskell.org
28. M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report Concurrent Clean. Tech. Report CSI-R9816, University of Nijmegen, June 1998. ftp://ftp.cs.kun.nl/pub/Clean/Clean13/doc/refman13.ps.gz.
29. M. Shields and S. Peyton Jones. Object-oriented overloading for Haskell. In Workshop on Multi-Language Infrastructure and Interoperability, Septemer 2001.
30. P. J. Sulzmann and M. Sulzmann. A theory of overloading. Technical report 2002/2, The University of Melbourne, 2002. http://www.cs.mu.oz.au/~sulzmann/chr/.
31. M. Sulzmann, and A. Rossberg. A theory of overloading part II: semantics and coherence. Technical report 2002/1, The University of Melbourne, 2002. http://www.cs.mu.oz.au/~sulzmann/chr/.
32. M. Sulzmann, A. Rossberg and J. Wazny. The Chameleon language manual. www.cs.mu.oz.au/~sulzmann/chameleon.
33. M. Sulzmann, A. Rossberg. Beyond type classes. Working paper. www.cs.mu.oz.au/~sulzmann/chr/.
34. M. Sulzmann. A General Framework for Hindley/Milner Type Systems with Constraints. PhD thesis, Yale University, Department of Computer Science, May 2000.
35. P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. of POPL'89, pages 60-76. ACM Press, 1989.
36. Z. Yang. Encoding types in ML-like languages. In Proc. of ICFP'98, pages 289-300. ACM Press, 1998.