Combining subsumption and binary methods: an object calculus with views

ABSTRACT

We presen t an object-oriented calculus whic hallows arbitrary hiding of methods in protot ypes, even in the presence of binary methods and friend functions. This combination of features permits complete control of the in terface a class exposes to the remainder of a program (which is of key importance for program readability, security and ease of maintenance), while still allowing complex in teractions with other classes belonging to the same module or softw are component.This result is made possible by the use of views. A view is a name that specifies an in terface to an object. A set of views is attached to each object and a method can be invoked either directly or via a view of the object.

REFERENCES

• 1: Viviana Bono , Michele Bugliesi , Mariangiola Dezani-Ciancaglini , Luigi Liquori, Subtyping Constraints for Incomplete Objects (Extended Abstract), Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.465-477, April 14-18, 1997
• 2: Viviana Bono , Kathleen Fisher, An Imperative, First-Order Calculus with Object Extension, Proceedings of the 12th European Conference on Object-Oriented Programming, p.462-497, July 20-24, 1998
• 3: 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
• 4: K. B. Bruce, A. Fiech, and L. Petersen. Subtyping is not a good "match" for object-oriented languages. In ECOOP, number 1241 in LNCS, pages 104-127. Springer-Verlag, 1997.
• 5: Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
• 6: Kathleen Fisher , Furio Honsell , John C. Mitchell, A lambda calculus of objects and method specialization, Nordic Journal of Computing, v.1 n.1, p.3-37, Spring 1994
• 7: Kathleen Fisher , John C. Mitchell, A Delegation-based Object Calculus with Subtying, Proceedings of the 10th International Symposium on Fundamentals of Computation Theory, p.42-61, August 22-25, 1995
• 8: K. Fisher and J. Reppy. Foundations for Moby classes. Bell Labs Technical Memorandum, December 1998.
• 9: Kathleen Fisher , John Reppy, The design of a class mechanism for Moby, Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, p.37-49, May 01-04, 1999, Atlanta, Georgia, United States
• 10: Kathleen Fisher , John H. Reppy, Extending Moby with Inheritance-Based Subtyping, Proceedings of the 14th European Conference on Object-Oriented Programming, p.83-107, June 12-16, 2000
• 11: Matthew Flatt , Shriram Krishnamurthi , Matthias Felleisen, Classes and mixins, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.171-183, January 19-21, 1998, San Diego, California, United States [doi>10.1145/268946.268961]
• 12: G. Ghelli and D. Palmerini. Foundations for extensible objects with roles. Presented at the FOOL'6 workshop, Jan. 1999.
• 13: Pietro Di Gianantonio , Furio Honsell , Luigi Liquori, A lambda calculus of objects with self-inflicted extension, Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, p.166-178, October 18-22, 1998, Vancouver, British Columbia, Canada
• 14: Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, I, Information and Computation, v.100 n.1, p.1-40, Sept. 1992 [doi>10.1016/0890-5401(92)90008-4]
• 15: B. C. Pierce and D. N. Turner. Statically typed friendly functions via partially abstract types. Technical Report ECS-LFCS-93-256, University of Edinburgh, LFCS, Apr. 1993. Also available as INRIA-Rocquencourt Rapport de Recherche No. 1899.
• 16: 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
• 17: Didier Rémy , Jérôme Vouillon, Objective ML: a simple object-oriented extension of ML, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.40-53, January 15-17, 1997, Paris, France [doi>10.1145/263699.263707]
• 18: Privacy via subsumption, Information and Computation, v.172 n.1, p.2-28, January 10, 2002 [doi>10.1006/inco.2000.2925 ]
• 19: M. Wand. Complete type inference for simple objects. In D. Gries, editor, Second Symposium on Logic In Computer Science, pages 207-276, Ithaca, New York, June 1987. IEEE Computer Society Press.
• 20: A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Technical Report COMP TR91-160, Department of Computer Science, Rice University, Houston, Texas, Apr. 1991.

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.1 Mathematical Logic
          Subjects: Lambda calculus and related systems

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES
  D.3 PROGRAMMING LANGUAGES

General Terms:
Design, Languages, Performance, Theory