Extracting programs from type class proofs

PPDP'06 - Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

Volumn 2006, Issue , 2006, Pages 97-108

  Sulzmann, Martin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Overloading; Proofs are programs principle; Type classes

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; INFORMATION ANALYSIS;

OVERLOADING; PROOFS ARE PROGRAMS PRINCIPLE; TYPE CLASSES;

PROBLEM SOLVING;

EID: 33750899009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1140335.1140348     Document Type: Conference Paper

References (38)

1. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proc. of CP'97, LNCS, pages 252-266. Springer-Verlag, 1997.
2. L. Augustsson. Implementing Haskell overloading. In Proc. of FPCA'93, pages 65-73. ACM Press, 1993.
3. M. Brandt and F. Henglein. Coinductive axiomatization of recursive type equality and subtyping. Fundam. Inf., 33(4):309-338, 1998.
4. M. Chakravarty, G. Keller, and S. Peyton Jones. Associated types synonyms. In Proc. of ICFP'05, pages 241-253. ACM Press, 2005.
5. B. Demoen, M. García de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In Proc. of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS, pages 174-188. Springer, October 1999.
6. G. J. Duck, S. Peyton Jones, P. J. Stuckey, and M. Sulzmann. Sound and decidable type inference for functional dependencies. In Proc. of ESOP'04, volume 2986 of LNCS, pages 49-63. Springer-Verlag, 2004.
7. K.-F. Faxén. A static semantics for Haskell. Journal of Functional Programming, 12(4&5):295-357, 2002.
8. T. Frühwirth. Constraint handling rules. In Constraint Programming: Basics and Trends, LNCS. Springer-Verlag, 1995.
9. Glasgow haskell compiler home page. http://www.haskell.org/ghc/.
10. 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.
11. R. Harper, F. Honsell, and G. Plotkin. A Framework for Defining Logics. In Proceedings 2nd Annual IEEE Symp. on Logic in Computer Science, LICS'87, pages 194-204. IEEE Computer Society Press, 1987.
12. F. Henderson et al. The Mercury language reference manual, 2001. http://www.cs.mu.oz.au/research/mercury/.
13. W.A. Howard. The formulae-as-types notion of construction. In J.P. Seldin and J.R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479-490. Academic Press, 1980.
14. Hugs home page, haskell.cs.yale.edu/hugs/.
15. D. Jeffery, F. Henderson, and Z. Somogyi. Type classes in Mercury. In Proc. Twenty-Third Australasian Computer Science Conf., volume 22 of Australian Computer Science Communications, pages 128-135. IEEE Computer Society Press, January 2000.
16. M. P. Jones. A system of constructor classes: Overloading and implicit higher-order polymorphism. In Proc. of FPCA '93, pages 52-61. ACM Press, 1993.
17. M. P. Jones. Simplifying and improving qualified types. In FPCA '95: Coherence on Functional Programming Languages and Computer Architecture. ACM Press, 1995.
18. M. P. Jones. Type classes with functional dependencies. In Proc. of ESOP'00, volume 1782 of LNCS. Springer-Verlag, 2000.
19. S. Kaes. Parametric overloading in polymorphic programming languages. In In Proc. of ESOP'88, volume 300 of LNCS, pages 131-141. Springer-Verlag, 1988.
20. R. Lämmel and S. Peyton Jones. Scrap your boilerplate with class: extensible generic functions. In Proc. of ICFP'05, pages 204-215. ACM Press, 2005.
21. J. Lassez, M. Maher, and K. Marriott. Unification revisited. In Foundations of Deductive Databases and Logic Programming. Morgan Kauffman, 1987.
22. K. Z. M. Lu and M. Sulzmann. An implementation of subtyping among regular expression types. In Proc. of APLAS'04, LNCS, pages 57-73. Springer-Verlag, 2004.
23. D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. Information and Control, 71:95-130, 1986.
24. R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348-375, Dec 1978.
25. J. Peterson and M.P. Jones. Implementing type classes. In Proc. of PLDI'93, pages 227-236. ACM Press, 1993.
26. S. Peyton Jones. Haskell 98 Language and Libraries: The Revised Report, 2003. Also see http://www.haskell.org/definition/.
27. S. Peyton Jones, M. P. Jones, and E. Meijer. Type classes: an exploration of the design space. In Haskell Workshop, June 1997.
28. 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.
29. F. Pottier, 2004. personal communication.
30. Z. Shao. An overview of the FLINT/ML compiler. In Proc. of ACM SIGPLAN Workshop on Types in Compilation (TIC'97), 1997.
31. Z. Shao, V. Trifonov, B. Saha, and N. Papaspyrou. A type system for certified binaries. ACM Trans. Program. Lang. Syst., 27(1):1-45, 2005.
32. J.R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
33. P. J. Stuckey and M. Sulzmann. A theory of overloading. ACM Transactions on Programming Languages and Systems (TOPLAS), 27(6):1-54, 2005.
34. M. Sulzmann and J. Wazny. Chameleon, http://www.comp.nus.edu.sg/- sulzmann/chameleon.
35. S. R. Thatte. Semantics of type classes revisited. In LFP '94: Proceedings of the 1994 ACM conference on LISP and functional programming, pages 208-219. ACM Press, 1994.
36. 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.
37. S. Wehr, 2005. http://www.haskell.org//pipermail/haskell/2005-October/ 016695.html.
38. A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Inf. Comput., 115(1):38-94, 1994.