Combining subsumption and binary methods: An object calculus with views

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 3, 2001, Pages 290-303

  Vouillon, Jérôme ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644395681     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/373243.360233     Document Type: Article

References (21)

1. V. Bono, M. Bugliesi, L. Liquori, and M. Dezani-Ciancaglini. Subtyping constraint for incomplete objects. In Proceedings of TAPSOFT/CAAP, number 1214 in LNCS, pages 465-477. Springer-Verlag, 1997.
2. V. Bono and K. Fisher. An imperative, first-order calculus with object extension. In ECOOP, pages 462-497, 1998.
3. K. B. Bruce, L. Cardelli, G. Castagna, T. H. O. Group, G. T. Leavens, and B. Pierce. On binary methods. Theory and Practice of Object Systems, 1(3):221-242, 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. L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. ACMCS, 17(4):471-522, Dec. 1985.
6. K. Fisher, F. Honsell, and J. C. Mitchell. A lambda calculus of objects and method specialization. Nordic Journal of Computing, 1(1):3-37, Spring 1994.
7. K. Fisher and J. Mitchell. A delegation-based object calculus with Subtyping. In Fundamentals of Computation Theory (FCT'95), number 965 in LNCS, pages 42-61. Springer-Verlag, 1995.
8. K. Fisher and J. Reppy. Foundations for Moby classes. Bell Labs Technical Memorandum, December 1998.
9. K. Fisher and J. Reppy. The design of a class mechanism for Moby. In A. Press, editor, Conference on Programming Language Design and Implementation, pages 37-49, 1999.
10. K. Fisher and J. Reppy. Extending Moby with inheritance-based subtyping. In ECOOP, number 1850 in LNCS, pages 83-107. Springer-Verlag, 2000.
11. M. Flatt, S. Krishnamurthi, and M. Felleisen. Classes and mixins. In Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 171-183, San Diego, California, 19-21 Jan. 1998.
12. G. Ghelli and D. Palmerini. Foundations for extensible objects with roles. Presented at the FOOL'6 workshop, Jan. 1999.
13. P. D. Gianantonio, F. Honsell, and L. Liquori. A lambda calculus of objects with self-inflicted extension. In A. S. Notices, editor, Proceedings of the conference on Object-oriented programming, systems, languages, and applications, pages 166-178, October 1998.
14. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Information and Computation, 100(1):1-40, Sept. 1992.
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. D. Rémy. Type inference for records in a natural extension of ML. In C. A. Gunter and J. C. Mitchell, editors, Theoretical Aspects Of Object-Oriented Programming. Types, Semantics and Language Design. MIT Press, 1994.
17. D. Rémy and J. Vouillon. Objective ML: An effective object-oriented extension to ML. Theory And Practice of Object Systems, 4(1):27-50, 1998. A preliminary version appeared in the proceedings of the 24th ACM Conference on Principles of Programming Languages, 1997.
18. D. Rémy and J. Vouillon. Objective ML: An effective object-oriented extension to ML. Theory And Practice of Object Systems, 4(1):27-50, 1998. A preliminary version appeared in the proceedings of the 24th ACM Conference on Principles of Programming Languages, 1997.
19. J. G. Riecke and C. A. Stone. Privacy via subsumption. Information and Computation, 2000. To appear.
20. 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.
21. 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.