Generics of a higher kind

ACM SIGPLAN Notices

Volumn 43, Issue 10, 2008, Pages 423-438

  Moors, Adriaan ^a   Piessens, Frank ^a   Odersky, Martin ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b EPFL   (Switzerland)

Author keywords

Higher kinded types; Higher order genericity; Scala; Type constructor polymorphism

Indexed keywords

C (PROGRAMMING LANGUAGE); POLYMORPHISM;

CODE DUPLICATION; DESIGN AND IMPLEMENTATIONS; FIRST-ORDER VARIANT; GENERICITY; HIGHER-KINDED TYPES; OBJECT ORIENTED; PARAMETRIC POLYMORPHISM; SCALA;

OBJECT ORIENTED PROGRAMMING;

EID: 67650067076     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1449955.1449798     Document Type: Article

References (56)

1. M. Abadi and L. Cardelli. A theory of primitive objects: Second-order systems. Sci. Comput. Program., 25 (2-3) :81-116, 1995.
2. M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and first-order systems. Inf. Comput., 125 (2) :78-102, 1996.
3. P. Altherr and V. Cremet. Adding type constructor parameterization to Java. Accepted to the workshop on Formal Techniques for Java-like Programs (FTfJP'07) at the European Conference on Object-Oriented Programming (ECOOP), 2007.
4. D. Aspinall and A. B. Compagnoni. Subtyping dependent types. Theor. Comput. Sci., 266 (1-2) :273-309, 2001.
5. G. M. Bierman, E. Meijer, and W. Schulte. The essence of data access in Comega. In A. P. Black, editor, ECOOP, volume 3586 of Lecture Notes in Computer Science, pages 287-311. Springer, 2005.
6. G. Bracha. Executable grammars in Newspeak. Electron. Notes Theor. Comput. Sci., 193:3-18, 2007.
7. K. B. Bruce, A. R. Meyer, and J. C. Mitchell. The semantics of second-order lambda calculus. Inf. Comput., 85 (1) :76-134, 1990.
8. K. B. Bruce, M. Odersky, and P. Wadler. A statically safe alternative to virtual types. In E. Jul, editor, ECOOP, volume 1445 of Lecture Notes in Computer Science, pages 523-549. Springer, 1998.
9. K. B. Bruce, A. Schuett, and R. van Gent. PolyTOIL: A typesafe polymorphic object-oriented language. In W. G. Olthoff, editor, ECOOP, volume 952 of Lecture Notes in Computer Science, pages 27-51. Springer, 1995.
10. P. S. Canning, W. R. Cook, W. L. Hill, W. G. Olthoff, and J. C. Mitchell. F-bounded polymorphism for object-oriented programming. In FPCA, pages 273-280, 1989.
11. L. Cardelli. Structural subtyping and the notion of power type. In POPL, pages 70-79, 1988.
12. L. Cardelli. Types for data-oriented languages. In J. W. Schmidt, S. Ceri, and M. Missikoff, editors, EDBT, volume 303 of Lecture Notes in Computer Science, pages 1-15. Springer, 1988.
13. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. ACM Computing Surveys, 17 (4) :471-522, 1985.
14. J. Carette, O. Kiselyov, and C. chieh Shan. Finally tagless, partially evaluated. In Z. Shao, editor, APLAS, volume 4807 of Lecture Notes in Computer Science, pages 222-238. Springer, 2007.
15. M. Chakravarty, S. L. P. Jones, M. Sulzmann, and T. Schrijvers. Class families, 2007. On the GHC Developer wiki, http://hackage.haskell.org/trac/ghc /wiki/TypeFunctions/ClassFamilies.
16. M. M. T. Chakravarty, G. Keller, S. L. P. Jones, and S. Marlow. Associated types with class. In J. Palsberg and M. Abadi, editors, POPL, pages 1-13. ACM, 2005.
17. A. B. Compagnoni and H. Goguen. Typed operational semantics for higher-order subtyping. Inf. Comput., 184 (2) :242-297, 2003.
18. V. Cremet and P. Altherr. Adding type constructor parameterization to Java. Journal of Object Technology, 7 (5) :25-65, June 2008. Special Issue: Workshop on FTfJP, ECOOP 07. http://www.jot.fm/issues/issue 2008 06/article2/.
19. # generics. In D. Thomas, editor, ECOOP, volume 4067 of Lecture Notes in Computer Science, pages 279-303. Springer, 2006.
20. E. Ernst. gbeta - a Language with Virtual Attributes, Block Structure, and Propagating, Dynamic Inheritance. PhD thesis, Department of Computer Science, University of Aarhus, A° rhus, Denmark, 1999.
21. E. Ernst. Family polymorphism. In J. L. Knudsen, editor, ECOOP, volume 2072 of Lecture Notes in Computer Science, pages 303-326. Springer, 2001.
22. J. Gibbons and G. Jones. The under-appreciated unfold. In ICFP, pages 273-279, 1998.
23. J. Girard. Interpretation fonctionelle et elimination des coupures de l'arithmetique d'ordre superieur. Thèse d'é tat, Paris VII, 1972.
24. J. Gosling, B. Joy, G. Steele, and G. Bracha. Java (TM) Language Specification, The (3rd Edition) (Java (Addison- Wesley)). Addison-Wesley Professional, 2005.
25. D. Gregor, J. Järvi, J. G. Siek, B. Stroustrup, G. D. Reis, and A. Lumsdaine. Concepts: linguistic support for generic programming in C++. In P. L. Tarr and W. R. Cook, editors, OOPSLA, pages 291-310. ACM, 2006.
26. C. Hofer, K. Ostermann, T. Rendel, and A. Moors. Polymorphic embedding of DSLs. In Y. Smaragdakis and J. Siek, editors, GPCE. ACM, 2008. To appear.
27. P. Hudak, J. Hughes, S. L. P. Jones, and P. Wadler. A history of Haskell: being lazy with class. In B. G. Ryder and B. Hailpern, editors, HOPL, pages 1-55. ACM, 2007.
28. P. Hudak, S. L. P. Jones, P. Wadler, B. Boutel, J. Fairbairn, J. H. Fasel, M. M. Guzmán, K. Hammond, J. Hughes, T. Johnsson, R. B. Kieburtz, R. S. Nikhil, W. Partain, and J. Peterson. Report on the programming language Haskell, a non-strict, purely functional language. SIGPLAN Notices, 27 (5) :R1-R164, 1992.
29. J. Hughes. Restricted datatypes in Haskell. Technical Report UU-CS-1999-28, Department of Information and Computing Sciences, Utrecht University, 1999.
30. G. Hutton and E. Meijer. Monadic Parser Combinators. Technical Report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996.
31. A. Igarashi, B. C. Pierce, and P. Wadler. Featherweight Java: a minimal core calculus for Java and GJ. ACM Trans. Program. Lang. Syst., 23 (3) :396-450, 2001.
32. M. P. Jones. constructor classes&"set" monad?, 1994. http://groups.google.com/group/comp. lang.functional/msg/e10290b2511c65f0.
33. M. P. Jones. A system of constructor classes: Overloading and implicit higher-order polymorphism. J. Funct. Program., 5 (1) :1-35, 1995.
34. E. Kidd. How to make data.set a monad, 2007. http: //www.randomhacks.net/ articles/2007/03 /15/data-set-monad-haskell-macros.
35. D. Leijen and E. Meijer. Parsec: Direct style monadic parser combinators for the real world. Technical Report UU-CS- 2001-27, Department of Computer Science, Universiteit Utrecht, 2001.
36. E. Meijer. There is no impedance mismatch: (language integrated query in Visual Basic 9). In P. L. Tarr and W. R. Cook, editors, OOPSLA Companion, pages 710-711. ACM, 2006.
37. E. Meijer. Confessions of a used programming language salesman. In R. P. Gabriel, D. F. Bacon, C. V. Lopes, and G. L. S. Jr., editors, OOPSLA, pages 677-694. ACM, 2007.
38. A. Moors, F. Piessens, and M. Odersky. Towards equal rights for higher-kinded types. Accepted for the 6th International Workshop on Multiparadigm Programming with Object- Oriented Languages at the European Conference on Object- Oriented Programming (ECOOP), 2007.
39. A. Moors, F. Piessens, and M. Odersky. Parser combinators in Scala. Technical Report CW491, Department of Computer Science, K. U. Leuven, 2008. http://www.cs.kuleuven. be/publicaties/rapporten/cw /CW491.abs.html.
40. A. Moors, F. Piessens, and M. Odersky. Safe type-level abstraction in Scala. In Proc. FOOL '08, Jan. 2008. http://fool08.kuis.kyoto-u.ac.jp/.
41. M. Odersky. Poor man's type classes, July 2006. Talk at IFIP WG 2.8, Boston.
42. M. Odersky. The Scala Language Specification, Version 2.6. EPFL, Nov. 2007. http://www.scala-lang.org /docu/files/ScalaReference.pdf.
43. M. Odersky, P. Altherr, V. Cremet, I. Dragos, G. Dubochet, B. Emir, S. McDirmid, S. Micheloud, N. Mihaylov, M. Schinz, L. Spoon, E. Stenman, and M. Zenger. An Overview of the Scala Programming Language (2. edition). Technical report, 2006.
44. M. Odersky, V. Cremet, C. Röckl, and M. Zenger. A nominal theory of objects with dependent types. In L. Cardelli, editor, ECOOP, volume 2743 of Lecture Notes in Computer Science, pages 201-224. Springer, 2003. [45] M. Odersky, L. Spoon, and B. Venners. Programming in Scala. Artima, 2008.
45. M. Odersky, C. Zenger, and M. Zenger. Colored local type inference. In POPL, pages 41-53, 2001.
46. M. Odersky and M. Zenger. Scalable component abstractions. In R. Johnson and R. P. Gabriel, editors, OOPSLA, pages 41-57. ACM, 2005.
47. H. Ossher and W. H. Harrison. Combination of inheritance hierarchies. In OOPSLA, pages 25-40, 1992.
48. B. C. Pierce and M. Steffen. Higher-order subtyping. Theor. Comput. Sci., 176 (1-2) :235-282, 1997.
49. J. C. Reynolds. Towards a theory of type structure. In B. Robinet, editor, Symposium on Programming, volume 19 of Lecture Notes in Computer Science, pages 408-423. Springer, 1974.
50. T. Sheard. Type-level computation using narrowing in Ωmega. Electr. Notes Theor. Comput. Sci., 174 (7) :105-128, 2007.
51. M. Steffen. Polarized Higher-Order Subtyping. PhD thesis, Universität Erlangen-Nürnberg, 1998.
52. K. K. Thorup and M. Torgersen. Unifying genericity - combining the benefits of virtual types and parameterized classes. In R. Guerraoui, editor, ECOOP, volume 1628 of Lecture Notes in Computer Science, pages 186-204. Springer, 1999.
53. P. Wadler. Comprehending monads. Mathematical Structures in Computer Science, 2 (4) :461-493, 1992.
54. P. Wadler. Monads for functional programming. In J. Jeuring and E. Meijer, editors, Advanced Functional Programming, volume 925 of Lecture Notes in Computer Science, pages 24-52. Springer, 1995.
55. P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In POPL, pages 60-76, 1989.
56. S. Wehr, R. Lämmel, and P. Thiemann. JavaGI : Generalized interfaces for Java. In E. Ernst, editor, ECOOP, volume 4609 of Lecture Notes in Computer Science, pages 347-372. Springer, 2007.