The design of a class mechanism for Moby

ABSTRACT

Typical class-based languages, such as C++ and JAVA, provide complex class mechanisms but only weak module systems. In fact, classes in these languages incorporate many of the features found in richer module mechanisms. In this paper, we describe an alternative approach to designing a language that has both classes and modules. In our design, we rely on a rich ML-style module system to provide features such as visibility control and parameterization, while providing a minimal class mechanism that includes only those features needed to support inheritance. Programmers can then use the combination of modules and classes to implement the full range of class-based features and idioms. Our approach has the advantage that it provides a full-featured module system (useful in its own right), while keeping the class mechanism quite simple.We have incorporated this design in MOBY, which is an ML-style language that supports class-based object-oriented programming. In this paper, we describe our design via a series of simple examples, show how various class-based features and idioms are realized in MOBY, compare our design with others, and sketch its formal semantics.

REFERENCES

• AC93: Roberto M. Amadio , Luca Cardelli, Subtyping recursive types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.4, p.575-631, Sept. 1993 [doi>10.1145/155183.155231]
• AC96: Martin Abadi , Luca Cardelli, A Theory of Objects, Springer-Verlag New York, Inc., Secaucus, NJ, 1996
• AG98: Ken Arnold , James Gosling, The Java programming language (2nd ed.), ACM Press/Addison-Wesley Publishing Co., New York, NY, 1998
• BCC+96: Kim Bruce , Luca Cardelli , Giuseppe Castagna , Gary T. Leavens , Benjamin Pierce, On binary methods, Theory and Practice of Object Systems, v.1 n.3, p.221-242, Fall 1995
• BFP97: Brace, K. B., A. Fiech, and L. Petersen. Subtyping is not a good "match" for object-oriented languages, in ECOOP'97, vol. 1241 of LNCS, New York, NY, 1997. Springer-Verlag, pp. 104-127.
• BPV98: Bruce, K. B., L. Petersen, and J. ~anderwaart. Modules in LOOM: Classes are not enough. Available from http: //www. cs. williams, edu/~kim, April 1998.
• BSv95: Kim B. Bruce , Angela Schuett , Robert van Gent, PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language, Proceedings of the 9th European Conference on Object-Oriented Programming, p.27-51, August 07-11, 1995
• CDG+89: Cardelli, L., J. Donahue, L. Glassman, M. Jordan, B. Kalsow, and G. Nelson. Modula-3 report (revised). Technical Report 52, Digital System Research Center, Palo Alto, CA, November 1989.
• CHC90: William R. Cook , Walter Hill , Peter S. Canning, Inheritance is not subtyping, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.125-135, December 1989, San Francisco, California, United States [doi>10.1145/96709.96721]
• Coo89: Cook, W. R. A proposal for making Eiffel type-safe. In ECOOP'89, 1989, pp. 57-72.
• Fis96: Kathleen Shanahan Fisher , John C. Mitchell, Type systems for object-oriented programming languages, 1996
• FM95: Kathleen Fisher , John C. Mitchell, The development of type systems for object-oriented languages, Theory and Practice of Object Systems, v.1 n.3, p.189-220, Fall 1995
• FR99: Fisher, K. and J. Reppy. Foundations for MOB Y classes. Technical Memorandum, Bell Labs, Lucent Technologies, Murray Hill, NJ, February 1999.
• GJS96: James Gosling , Bill Joy , Guy L. Steele, The Java Language Specification, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1996
• HL94: Robert Harper , Mark Lillibridge, A type-theoretic approach to higher-order modules with sharing, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.123-137, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.176927]
• HS97: Harper, R. and C. Stone. An interpretation of Standard ML in type theory. Technical Report CMU-CS-97-147, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, June 1997.
• Jav97: Inner classes specification, February 1997. Available from http: / / java. sun. com/products/jDK/1.1.
• KLM94: Dinesh Katiyar , David Luckham , John Mitchell, A type system for prototyping languages, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.138-150, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.177838]
• Ler94: Xavier Leroy, Manifest types, modules, and separate compilation, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.109-122, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.176926]
• Ler96: Leroy, X. A syntacfc theory of type generativity and sharing. JFP, 6(5), September 1996, pp. 1-32.
• Ler98: Leroy, X. The Objective Caml System (release 2.00), August 1998. Available from http: //pauillac. inria, fr/caml.
• Mac84: David MacQueen, Modules for standard ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.198-207, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802036]
• MTHM97: Robin Milner , Mads Tofte , Robert Harper, The definition of Standard ML, MIT Press, Cambridge, MA, 1990
• Pro95: Programming Methodology Group, MIT LCS, Cambridge, MA. Theta Reference Manual (Preliminary Version), February 1995. Available from httD: //www .pmg. lcs .mit. edu/Theta, html.
• PT93: Pierce, B. C, and D. N. Turner. Statically typed friendly functions via partially abstract types. Technical Report ECS-LFCS-93-256, University of Edinburgh, LFCS, April 1993. Also available as INRIA-Rocquencourt Rapport de Recherche No. 1899.
• PT98: Benjamin C. Pierce , David N. Turner, Local type inference, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.252-265, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268967]
• Rém94: Didier Rémy, Type inference for records in natural extension of ML, Theoretical aspects of object-oriented programming: types, semantics, and language design, MIT Press, Cambridge, MA, 1994
• RR96a: Reppy, J. H. and J. G. Riecke. Classes in Object ML via modules. In FOOL3, July 1996.
• RR96b: John Reppy , Jon Riecke, Simple objects for Standard ML, Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation, p.171-180, May 21-24, 1996, Philadelphia, Pennsylvania, United States
• RS98: Riecke, J. G. and C. Stone. Privacy via subsumpfion. In FOOL5, January 1998. A longer version will appear in TAPOS.
• RV98: Didier Rémy , Jérôme Vouillon, Objective ML: an effective object-oriented extension to ML, Theory and Practice of Object Systems, v.4 n.1, p.27-50, 1998 [doi>10.1002/(SICI)1096-9942(1998)4:1<27::AID-TAPO3>3.0.CO;2-4]
• Str94: Bjarne Stroustrup, The design and evolution of C++, ACM Press/Addison-Wesley Publishing Co., New York, NY, 1995
• Str97: Bjarne Stroustrup, The C++ programming language (2nd ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1991
• Szy92: Clemens A. Szyperski, Import is Not Inheritance - Why We Need Both: Modules and Classes, Proceedings of the European Conference on Object-Oriented Programming, p.19-32, June 29-July 03, 1992
• Vou98: Vouillon, J. Using modules as classes. In FOOL5, January 1998.

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: ML

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
  D.3 PROGRAMMING LANGUAGES
      D.3.3 Language Constructs and Features
          Subjects: Modules, packages

General Terms:
Design, Languages, Performance, Theory