A core calculus for scala type checking

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

Volumn 4162 LNCS, Issue , 2006, Pages 1-23

  Cremet, Vincent ^a   Garillot, François ^b   Lenglet, Sergueï ^c   Odersky, Martin ^a  

^a EPFL   (Switzerland)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; PROBLEM SOLVING;

SCALA PROGRAMMING;

COMPUTATION THEORY;

EID: 33750038832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11821069_1     Document Type: Conference Paper

References (35)

1. P. Altherr. A Typed Intermediate Language and Algorithms for Compiling Scala by Successive Rewritings. PhD thesis, EPFL, March 2006. No. 3509.
2. P. Altherr and V. Cremet. Inner Classes and Virtual Types. EPFL Technical Report IC/2005/013, March 2005.
3. D. Ancona and E. Zucca. A primitive calculus for module systems. In Principles and Practice of Declarative Programming, LNCS 1702, 1999.
4. D. Ancona and E. Zucca. A calculus of module systems. Journal of Functional Programming, 2002.
5. G. Bracha. The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance. PhD thesis, University of Utah, 1992.
6. G. Bracha and G. Lindstrom. Modularity meets inheritance. In Proceedings of the IEEE Computer Society International Conference on Computer Languages, pages 282-290, Washington, DC, 1992. IEEE Computer Society.
7. K. Bruce. Some challenging typing issues in object-oriented languages. In Electronic notes in Theoretical Computer Science, volume 82(8)., 2003.
8. K. B. Bruce, M. Odersky, and P. Wadler. A statical safe alternative to virtual types. In Proceedings of the 5th International Workshop on Foundations of Object-Oriented Languages, San Diego, USA, 1998.
9. K. Crary, R. Harper, and S. Puri. What is a recursive module? In SIGPLAN Conference on Programming Language Design and Implementation, pages 50-63, 1999.
10. V. Cremet. Foundations for Scala: Semantics and Proof of Virtual Types. PhD thesis, EPFL, May 2006. No. 3556.
11. E. Ernst. gBeta: A language with virtual attributes, block structure and propagating, dynamic inheritance. PhD thesis, Department of Computer Science, University of Aarhus, Denmark, 1999.
12. E. Ernst. Family polymorphism. In Proceedings of the European Conference on Object-Oriented Programming, pages 303-326, Budapest, Hungary, 2001.
13. E. Ernst, K. Ostermann, and W. Cook. A virtual class calculus. In ACM Symposium on Principles of Programming Languages (POPL'06), Jan. 2006.
14. J. Garrigue. Code reuse through polymorphic variants. In In Workshop on Foundations of Software Engineering, Sasaguri, Japan, November 2000., 2000.
15. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages, January 1994.
16. T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. In European Symposium on Programming, pages 6-20, 2002.
17. A. Igarashi and B. C. Pierce. Foundations for virtual types. Information and Computation, 175(1):34-49, 2002.
18. A. Igarashi and B. C. Pierce. On inner classes. Inf. Comput., 177(1):56-89, 2002.
19. A. Igarishi, B. Pierce, and P. Wadler. Featherweight Java: A minimal core calculus for Java and GJ. In Proc. OOPSLA, Nov. 1999.
20. P. Jolly, S. Drossopoulou, C. Anderson, and K. Ostermann. Simple dependent types: Concord. In Proc. FTfJP, 2004.
21. X. Leroy. A syntactic theory of type generativity and sharing. In ACM Symposium on Principles of Programming Languages (POPL), Portland, Oregon, 1994.
22. O. L. Madsen, B. Møller-Pedersen, and K. Nygaard. Object-Oriented Programming in the BETA Programming Language. Addison-Wesley, June 1993. ISBN 0-201-62430-3.
23. K. Nakata, A. Ito, and J. Garrigue. Recursive object-oriented modules. In Proc. FOOL 12, Jan. 2005.
24. N. Nystrom, S. Chong, and A. Myers. Scalable extensibility via nested inheritance. In Proc. OOPSLA, pages 99-115, 2005.
25. M. Odersky, V. Cremet, C. Röckl, and M. Zenger. A nominal theory of objects with dependent types. In Proc. ECOOP'03, Springer LNCS, July 2003.
26. M. Odersky, C. Zenger, and M. Zenger. Colored local type inference. In Proceedings of the 28th ACM Symposium on Principles of Programming Languages, pages 41-53, January 2001.
27. M. Odersky and M. Zenger. Independently extensible solutions to the expression problem. In Proc. FOOL 12, Jan. 2005. http://homepages.inf.ed.ac.vik/ wadler/fool.
28. M. Odersky and M. Zenger. Scalable component abstractions. In Proc. OOPSLA, 2005.
29. B. C. Pierce. Bounded quantification is undecidable. Information and Computation, 112(1):131-165, July 1994.
30. B. C. Pierce and D. N. Turner. Local type inference. In Proc. POPL, 1998.
31. D. Rémy and J. Vuillon. On the (un)reality of virtual types, available from http://pauillac.inria.fr/remy/work/virtual, Mar. 2000.
32. M. Torgersen. Virtual types are statically safe. In 5th Workshop on Foundations of Object-Oriented Languages, San Diego, CA, USA, January 1998.
33. M. Torgersen. The expression problem revisited: Four new solutions using generics. In Proc. ECOOP 2004, volume 3086 of Springer LNCS, pages 123-143. Springer-Verlag, July 2004.
34. M. Torgersen, C. P. Hansen, E. Ernst, P. vod der Ahé, G. Bracha, and N. Gafter. Adding wildcards to the Java programming language. In Proceedings SAC'04, pages 1289-1296, Nicosia, Cyprus, Mar. 2004. ACM Press.
35. S. Zdancewic. Type inference for Java 5: Wildcards, F-bounds, and undecidability. http://www.cis.upenn.edu/~stevez/note.html, 2006.