Matching constraints for the Lambda Calculus of Objects

  • Viviana Bono
  • Michele Bugliesi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1210)


We present a new type system for the Lambda Calculus of Objects [16], based on matching. The new system retains the property of type safety of the original system, while using implicit match-bounded quantification over type variables instead of implicit quantification over row schemes (as in [16]) to capture Mytype polymorphic types for methods. Type soundness for the new system is proved as a direct corollary of subject reduction. A study of the relative expressive power of the two systems is also carried out, that shows that the new system is as powerful as the original one on derivations of closed-object typing judgements. Finally, an extension of the new system is presented, that gives provision for a class-based calculus, where primitives such as creation of class instances and method update are rendered in terms of delegation.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Abadi and L. Cardelli. An Imperative Objects Calculus. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, Proceedings of TAPSOFT'95: Theory and Practice of Software Development, volume 915 of LNCS, pages 471–485. Springer-Verlag, May 1995.Google Scholar
  2. 2.
    M. Abadi and L. Cardelli. On Subtyping and Matching. In Proceedings of ECOOP'95: European Conference on Object-Oriented Programming, volume 952 of LNCS, pages 145–167. Springer-Verlag, August 1995.Google Scholar
  3. 3.
    M. Abadi and L. Cardelli. A Theory of Primitive Objects. Information and Computation, 125(2):78–102, March 1996.Google Scholar
  4. 4.
    V. Bono and M. Bugliesi. Matching Lambda Calculus of Objects. Submitted for publication, 1996.Google Scholar
  5. 5.
    V. Bono, M. Bugliesi, and L. Liquori. A Lambda Calculus of Incomplete Objects. In Proc. of MFCS, volume 1113 of Lecture Notes in Computer Science, pages 218–229. Springer-Verlag, 1996.Google Scholar
  6. 6.
    V. Bono, M. Bugliesi, M.Dezani, and L. Liquori. Subtyping Constraints for Incomplete Objects. In Proc. of CAAP, Lecture Notes in Computer Science. Springer-Verlag, 1997. To appear.Google Scholar
  7. 7.
    V. Bono and L. Liquori. A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects. In Proc. of CSL, volume 933 of Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, 1995.Google Scholar
  8. 8.
    K.B. Bruce. A Paradigmatic Object-Oriented Programming Language: Design, Static Typing and Semantcs. Journal of Functional Programming, 1(4):127–206, 1994.Google Scholar
  9. 9.
    L. Cardelli. A Semantics of Multiple Inheritance. Information and Computation, 76:138–164, 1988.Google Scholar
  10. 10.
    L. Cardelli and J.C. Mitchell. Operations on Records. Mathematical Structures in Computer Sciences, 1(1):3–48, 1991.Google Scholar
  11. 11.
    L. Cardelli and P. Wegner. On Understanding Types, Data Abstraction and Polymorphism. Computing Surveys, 17(4):471–522, 1985.Google Scholar
  12. 12.
    W. Cook. A Self-ish Model of Inheritance. Manuscript, 1987.Google Scholar
  13. 13.
    W. Cook, W. Hill, and P. Canning. Inheritance is not Subtyping. In Proc. of ACM Symp. POPL, pages 125–135. ACM Press, 1990.Google Scholar
  14. 14.
    W.R. Cook. A Denotational Semantics of Inheritance. PhD thesis, Brown University, 1989.Google Scholar
  15. 15.
    Harper R., Honsell F. and Plotkin G.. A Framework for Defining Logics. J.ACM, 40(1):143–184, 1993.Google Scholar
  16. 16.
    K. Fisher, F. Honsell, and J. C. Mitchell. A Lambda Calculus of Objects and Method Specialization. Nordic Journal of Computing, 1(1):3–37, 1994.Google Scholar
  17. 17.
    K. Fisher and J. C. Mitchell. A Delegation-based Object Calculus with Subtyping. In Proc. of FCT, volume 965 of Lecture Notes in Computer Science, pages 42–61. Springer-Verlag, 1995.Google Scholar
  18. 18.
    M. Wand. Complete Type Inference for Simple Objects. In Proc. of IEEE Symp. LICS, pages 37–44. Silver Spring, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Viviana Bono
    • 1
  • Michele Bugliesi
    • 2
  1. 1.Dipartimento di InformaticaUniversità di TorinoTorinoItaly
  2. 2.Dipartimento di MatematicaUniversità di PadovaPadovaItaly

Personalised recommendations