Functional pearl: Implicit configurations - Or, type classes reflect the values of types

Proceedings of the ACM SIGPLAN 2004 Haskell Workshop, Haskell'04

Volumn , Issue , 2004, Pages 33-44

  Kiselyov, Oleg ^a   Shan, Chung Chieh ^b  

^a Fleet Numerical Meteorology and Oceanography Center   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Existential types; Higher rank polymorphism; Implicit parameters; Polymorphic recursion; Type classes

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; CRYPTOGRAPHY; DATA REDUCTION; ERROR ANALYSIS; PARAMETER ESTIMATION; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

EXISTENTIAL TYPES; HIGHER-RANK POLYMORPHISM; IMPLICIT PARAMETERS; POLYMORPHIC RECURSION; TYPE CLASSES;

COMPUTER PROGRAMMING;

EID: 11244309683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. J.Adriano. Re: I need some help. Message to the Haskell mailing list; http://www.mail-archive.com/haskell@haskell.org/msg10565.html, 26Mar. 2002.
2. M. Blume. No-longer-foreign: Teaching an ML compiler to speak C "natively". In P. N. Benton and A. Kennedy, editors, BABEL'01: 1st International Workshop on Multi-Language Infrastructure and Interoperability, number 59(1) in Electronic Notes in Theoretical Computer Science. Amsterdam, Nov. 2001. Elsevier Science.
3. A. Bromage. Dealing with configuration data. Message to the Haskell mailing list; http://www.haskell.org/pipernail/haskell-cafe/2002-September/ 003411.html, Sept. 2002.
4. M. Chakravarty, S. Finne, F. Henderson, M. Kowalczyk, D. Leijen, S. Marlow, E. Meijer, S. Panne, S. L. Peyton Jones, A. Reid, M. Wallace, and M. Weber. The Haskell 98 foreign function interface 1.0: An addendum to the Haskell 98 report, http://www.cse.unsw.edu.au/~chak/haskell/ffi/, 2003.
5. K. Claessen. Dealing with configuration data. Message to the Haskell mailing list; http://www.haskell.org/pipermail/haskell-cafe/2002-September/ 003419.html,Sept. 2002.
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, Mar. 1996.
7. L. Hu et al. Dealing with configuration data. Messages to the Haskell mailing list; http://www.haskell.org/pipermail/haskell-cafe/2002-September/ thread.html, Sept. 2002.
8. J. Hughes. Restricted datatypes in Haskell. In E. Meijer, editor, Proceedings of the 1999 Haskell Workshop, number UU-CS-1999-28 in Tech. Rep. Department of Computer Science, Utrecht University, 1999.
9. J. Hughes. Global variables in Haskell. Journal of Functional Programming, 2001. To appear. http://www.cs.chalmers.se/~rjmh/Globals.ps.
10. M. P. Jones. Dictionary-free overloading by partial evaluation. In Proceedings of the 1994 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, New York, 1994. ACM Press.
11. M. P. Jones. Type classes with functional dependencies. In G. Smolka, editor, Programming Languages and Systems: Proceedings of ESOP 2000, 9th European Symposium on Programming, number 1782 in Lecture Notes in Computer Science, pages 230-244, Berlin, 2000. Springer-Verlag.
12. W. Kahan. How Java's floating-point hurts everyone everywhere. Invited talk, ACM 1998 Workshop on Java for High-Performance Network Computing; http://www.cs.ucsb.edu/conferences/java98/papers/javahurt.pdf, 1 Mar. 1998.
13. W. Kahl and J. Scheffczyk. Named instances for Haskell type classes. In R. Hinze, editor, Proceedings of the 2001 Haskell Workshop, number UU-CS-2001-23 in Tech. Rep., pages 71-99. Department of Computer Science, Utrecht University, 2 Sept. 2001.
14. O. Kiselyov. Pure file reading (was: Dealing with configuration data). Message to the Haskell mailing list; http://www.haskell.org/pipermail/haskell- cafe/2002-September/003423.html, Sept. 2002.
15. O. Kiselyov and C.-c. Shan. Functional pearl: Implicit configurations - or, type classes reflect the values of types. Technical Report TR-15-04, Harvard University, Cambridge, 2004.
16. I. Koren. Computer Arithmetic Algorithms. A K Peters, Natick, MA, 2002.
17. J. Launchbury and S. L. Peyton Jones. Lazy functional state threads. In PLDI'94: Proceedings of the ACM Conference on Programming Language Design and Implementation, volume 29(6) of ACM SIGPLAN Notices, pages 24-35. New York, 1994. ACM Press.
18. J. Launchbury and S. L. Peyton Jones. State in Haskell. Lisp and Symbolic Computation. 8(4):293-341. Dec. 1995.
19. J. R. Lewis, M. B. Shields, E. Meijer, and J. Launchbury. Implicit parameters: Dynamic scoping with static types. In POPL '00: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pages 108-118, New York, 2000. ACM Press.
20. S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In POPL '95: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pages 333-343, New York, 1995. ACM Press.
21. C. McBride. Faking it: Simulating dependent types in Haskell. Journal of Functional Programming, 12(4-5):375-392, 2002.
22. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, Apr. 1985.
23. C. Okasaki. From fast exponentiation to square matrices: An adventure in types. In ICFP'99: Proceedings of the ACM International Conference on Functional Programming, volume 34(9) of ACM SIGPLAN Notices, pages 28-35, New York, 1999. ACM Press.
24. OpenSSL. The open source toolkit for SSL/TLS. Version 0.9.7d; http://www. openssl.org/, 17 Mar. 2004.
25. B. Parhami. Computer Arithmetic: Algorithms and Hardware Designs. Oxford University Press. New York, 2000.
26. S. L. Peyton Jones. Solution to the monomorphism restriction/implicit parameter problem. Message to the Haskell mailing list; http://www.haskell.org/ pipermail/haskell/2003-August/012412.html, 5 Aug. 2003.
27. S. L. Peyton Jones and M. B. Shields. Lexically-scoped type variables, Mar. 2002. To be submitted to Journal of Functional Programming.
28. C. Queinnec. Lisp in Small Pieces. Cambridge University Press, Cambridge, 1996.
29. G. Russell. Initialisation without unsafePerformIO. Message to the Haskell mailing list; http://www.haskell.org/pipermail/haskell/2004-June/014104. html, June 2004.
30. M. A. Soderstrand, W. K. Jenkins, G. A. Jullien, and F. J. Taylor, editors. Residue Number System Arithmetic: Modern Applications in Digital Signal Processing. IEEE Computer Society Press, Washington, DC, 1986.
31. D. Thurston. Modular arithmetic. Messages to the Haskell mailing list; http://www.haskell.org/pipermail/haskell-cafe/2001-August/002132.html; http://www.haskell.org/pipermail/haskell-cafe/ 2001-August/002133.html, 21 Aug. 2001.
32. V. Trifonov. Simulating quantified class constraints. In Proceedings of the 2003 Haskell Workshop, pages 98-102, New York, 2003. ACM Press.
33. P. L. Wadler and S. Blott. How to make ad-hoc polymorphism less ad hoc. In POPL '89: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pages 60-76, New York, 1989. ACM Press.