Principal type inference for GHC-style multi-parameter type classes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4279 LNCS, Issue , 2006, Pages 26-43

  Sulzmann, Martin ^a   Schrijvers, Tom ^b,d   Stuckey, Peter J ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF MELBOURNE   (Australia)

^d RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; PARAMETER ESTIMATION; PROBLEM SOLVING; PROGRAM COMPILERS; USER INTERFACES;

ADVANCED TYPE EXTENSIONS; GLASGOW HASKELL COMPILER (GHC); PRINCIPAL TYPE INFERENCE; TYPE ANNOTATIONS;

COMPUTER SCIENCE;

EID: 33845941738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11924661_2     Document Type: Conference Paper

References (27)

1. L. Damas and R. Milner. Principal type-schemes for functional programs. In Proc. of POPL'82, pages 207-212. ACM Press, January 1982.
2. B. Demoen, M. García de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In J. Jaffar, editor, Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS, pages 174-188. Springer-Verlag, October 1999.
3. K. F. Faxén. Haskeil and principal types. In Proc. of Haskell Workshop'03, pages 88-97. ACM Press, 2003.
4. T. Frühwirth. Constraint Handling Rules. In Constraint Programming: Basics and Trends, LNCS. Springer-Verlag, 1995.
5. Glasgow haskell compiler home page, http://www.haskell.org/ghc/.
6. C. V. Hall, K. Hammond, S. L. Peyton Jones, and P. L. Wadler. Type classes in Haskell. ACM Transactions on Programming Languages and Systems, 18(2):109-138, 1996.
7. F. Henderson et al. The Mercury language reference manual, 2001. http://www.cs.mu.oz.au/research/mercury/.
8. Fritz Henglein. Type inference with polymorphic recursion. Transactions on Programming Languages and Systems, 15(1):253-289, April 1993.
9. Hugs home page. haskell.cs.yale.edu/hugs/.
10. D. Jeffery, F. Henderson, and Z. Somogyi. Type classes in Mercury. In J. Edwards, editor, Proc. Twenty-Third Australasian Computer Science Conf., volume 22 of Australian Computer Science Communications, pages 128-135. IEEE Computer Society Press, January 2000.
11. M. P. Jones. Coherence for qualified types. Research Report YALEU/DCS/RR-989, Yale University, Department of Computer Science, September 1993.
12. M. P. Jones. Type classes with functional dependencies. In Proc. of ESOP'00, volume 1782 of LNCS. Springer-Verlag, 2000.
13. S. Peyton Jones, M. P. Jones, and E. Meijer. Type classes: an exploration of the design space. In Haskell Workshop, June 1997.
14. V. Kuncak and M. Rinard. Structural subtyping of non-recursive types is decidable. In Proc. of LICS'03, pages 96-107. IEEE Computer Society, 2003.
15. J. Lassez, M. Maher, and K. Marriott. Unification revisited. In Foundations of Deductive Databases and Logic Programming. Morgan Kauffman, 1987.
16. K. Läufer. Type classes with existential types. Journal of Functional Programming, 6(3):485-517, 1996.
17. K. Läufer and M. Odersky. Polymorphic type inference and abstract data types. ACM Trans. Program. Lang. Syst., 16(5):1411-1430, 1994.
18. Dale Miller. Unification under a mixed prefix. J. Symb. Comput., 14(4):321-358, 1992.
19. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, Dec 1978.
20. M. Odersky and K. Läufer. Putting type annotations to work. In Proc. of POPL'96, pages 54-67. ACM Press, 1996.
21. S. Peyton Jones, editor. Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press, 2003.
22. M.J. Plasmeijer and M.C.J.D. van Eekelen. Language report Concurrent Clean. Technical Report CSI-R9816, Computing Science Institute, University of Nijmegen, Nijmegen, The Netherlands, June 1998. ftp://ftp.cs.kun.nl/pub/Clean/ Clean13/doc/refman13.ps.gz.
23. J.R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
24. P. J. Stuckey and M. Sulzmann. A theory of overloading. ACM Transactions on Programming Languages and Systems (TOPLAS), 27(6):1-54, 2005.
25. M. Sulzmann, G. J. Duck, S. Peyton Jones, and P. J. Stuckey. Understanding functional dependencies via Constraint Handling Rules. Journal of Functional Programming, 2006. To appear.
26. M. Sulzmann, T. Schrijvers, and P.J.Stuckey. Principal type inference for GHC-style multi-parameter type classes. Technical report, The National University of Singapore, 2006.
27. M. Sulzmann, J. Wazny, and P.J.Stuckey. A framework for extended algebraic data types. In Proc. of FLOPS'06, volume 3945 of LNCS, pages 47-64. Springer-Verlag, 2006.