Strongly typed heterogeneous collections

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

Volumn , Issue , 2004, Pages 96-107

  Kiselyov, Oleg ^a   Lämmel, Ralf ^b   Schupke, Keean ^c  

^a FNMOC   (United States)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Collections; Dependently typed programming; Extensible records; Haskell; Type equality; Type improvement; Type indexed rows; Type safe database access

Indexed keywords

CODES (SYMBOLS); DATABASE SYSTEMS; DIGITAL LIBRARIES; ITERATIVE METHODS; PROGRAM PROCESSORS; XML;

DEPENDENT TYPED PROGRAMMING; EXTENSIBLE RECORDS; HASKELL; HETEROGENEOUS COLLECTIONS; TYPE EQUALITY; TYPE IMPROVEMENT; TYPE-INDEXED ROWS; TYPE-SAFE DATABASE ACCESS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 11244320503     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1017472.1017488     Document Type: Conference Paper

References (35)

1. This paper's web site http://www.cwi.nl/~ralf/HList/, 2004. This site provides an extended paper version with extra appendicies that could not be included into the Haskell workshop paper. This site also provides a source code distribution for the GHC and Hugs implementations of Haskell.
2. M. Abadi, L. Cardelli, B. Pierce, and G. Plotkin. Dynamic typing in a statically-typed language. In 16th ACM Conference on Principles of Programming Languages, pages 213-227, Jan. 1989.
3. M. Abadi, L. Cardelli, B. Pierce, and D. Remy. Dynamic typing in polymorphic languages. In Proceedings of the 1992 ACM Workshop on ML and its Applications, pages 92-103, San Francisco, June 1992.
4. A. Baars and S. Swierstra. Typing dynamic typing. In Proceedings of the seventh ACM SIGPLAN International Conference on Functional Programming, pages 157-166. ACM Press, 2002.
5. G. Bracha and G. Lindstrom. Modularity Meets Inheritance. In Proceedings: 4th International Conference on Computer Languages, pages 282-290. IEEE Computer Society Press, 1992.
6. F. Burton. Type extension through polymorphism. TOPLAS, 12(1):135-138, 1990.
7. K. Chen, P. Hudak, and M. Odersky. Parametric type classes. In Proceedings of the 1992 ACM Conference on LISP and Functional Programming, pages 170-181. ACM Press, 1992.
8. J. Cheney and R. Hinze. A lightweight implementation of generics and dynamics. In Proceedings of the ACM SIGPLAN Workshop on Haskell, pages 90-104. ACM Press, 2002.
9. G. Duck, S. Peyton Jones, P. Stuckey, and M. Sulzmann. Sound and Decidable Type Inference for Functional Dependencies. In D. Schmidt, editor, Proceedings, 13th European Symposium on Programming, ESOP 2004, Barcelona, Spain, March 29 - April 2, 2004, volume 2986 of LNCS, pages 49-63. Springer-Verlag, 2004.
10. B. Gaster and M. Jones. A Polymorphic Type System for Extensible Records and Variants. Technical report NOTTCS-TR-96-3, University of Nottingham, Department of Computer Science, Nov. 1996.
11. H. Nilsson. The Future of Haskell discussion at the Haskell Workshop, 2003. http://www.mail-archive.com/haskell\~haskell.org/msg13366.html.
12. T. Hallgren. Fun with functional dependencies. In Joint Winter Meeting of the Departments of Science and Computer Engineering, Chalmers University of Technology and Goteborg University, Varberg, Sweden, Jan. 2001, 2001. http://www.cs.chalmers.se/~hallgren/Papers/wm01.html.
13. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In 22nd ACM Symposium on Principles of Programming Languages (POPL'95), pages 130-141. ACM Press, Jan. 1995.
14. E. W. J. Van den Bussche. Polymorphic type inference for the relational algebra. Journal of Computer and System Sciences, 64:694-718, 2002. An extended abstract appeared in PODS'99.
15. M. Jones. A theory of qualified types. In Symposium proceedings on 4th European symposium on programming, pages 287-306. Springer-Verlag, 1992.
16. M. Jones. Simplifying and improving qualified types. In Proceedings of the seventh international conference on Functional Programming Languages and Computer Architecture, pages 160-169. ACM Press, 1995.
17. M. Jones. Type classes with functional dependencies. In Proceedings of the 9th European Symposium on Programming Languages and Systems, pages 230-244. Springer-Verlag, 2000.
18. R. Lämmel and S. Peyton Jones. Scrap your boilerplate: a practical design pattern for generic programming. ACM SIGPLAN Notices, 38(3):26-37, Mar. 2003. Proc. of the ACM SIGPLAN Workshop TLDI 2003.
19. D. Leijen and E. Meijer. Domain specific embedded compilers. In Proceedings of the 2nd conference on Domain-Specific Languages, pages 109-122. ACM Press, 1999.
20. C. McBride. Faking It (Simulating Dependent Types in Haskell), July 2002.
21. M. Neubauer, P. Thiemann, M. Gasbichler, and M. Sperber. A Functional Notation for Functional Dependencies. In Proc. 2001 ACM SIGPLAN Haskell Workshop, Firenze, Italy, September 2001, pages 101-120, 2001.
22. M. Neubauer, P. Thiemann, M. Gasbichler, and M. Sperber. Functional logic overloading. In Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of Programming languages, pages 233-244. ACM Press, 2002.
23. A. Ohori. A polymorphic record calculus and its compilation. ACM TOPLAS, 17(6):844-895, 1995.
24. C. Okasaki. From fast exponentiation to square matrices: an adventure in types. In Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming, pages 28-35. ACM Press, 1999.
25. C. Okasaki. An Overview of Edison. In G. Hutton, editor, Electronic Notes in Theoretical Computer Science, volume 41. Elsevier, 2001.
26. S. Peyton Jones. Adding Ord constraint to instance Monad Set?, 2004. http://www.haskell.org/pipermail/haskell-cafe/2004-March/005998.html.
27. S. Peyton Jones, M. Jones, and E. Meijer. Type classes: exploring the design space. In J. Launchbury, editor, Haskell workshop, Amsterdam, 1997.
28. S. Peyton Jones and G. Morrisett. A proposal for records in Haskell, 24 Feb. 2003. Online document: http://research.microsoft.com/~simonpj/Haskell/ records.html.
29. D. Remy. Type inference for records in natural extension of ml. In Theoretical aspects of object-oriented programming: types, semantics, and language design, pages 67-95. MIT Press, 1994.
30. M. Shields and E. Meijer. Type-indexed rows. In Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 261-275. ACM Press, 2001.
31. P. Stuckey and M. Sulzmann. A theory of overloading. In Proceedings of the seventh ACM SIGPLAN International Conference on Functional Programming, pages 167-178. ACM Press, 2002.
32. M. Sulzmann et al. Chameleon, 2004. Web site http://www.comp.nus.edu.sg/ ~sulzmann/chameleon/.
33. S. Weirich. Type-safe cast: (functional pearl). In Proceedings of the fifth ACM SIGPLAN International Conference on Functional Programming, pages 58-67. ACM Press, 2000.
34. H. Xi and F. Pfenning. Dependent types in practical programming. In Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages, pages 214-227. ACM Press, 1999.
35. Z. Yang. Encoding types in ML-Like languages. In M. Herman and S. Berman, editors, Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98), volume 34, 1 of ACM SIGPLAN Notices, pages 289-300, New York, Sept. 27-29 1998. ACM Press.