A theory of primitive objects

Second-order systems
  • Martín Abadi
  • Luca Cardelli
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 788)


We describe a second-order calculus of objects. The calculus supports object subsumption, method override, and the type Self. It is constructed as an extension of System F with subtyping, recursion, and first-order object types.


Function Type Object Type Universal Quantifier Existential Quantifier Covariance Requirement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Abadi, Cardelli 1994a]
    M. Abadi and L. Cardelli, A semantics of object types. To appear.Google Scholar
  2. [Abadi, Cardelli 1994b]
    M. Abadi and L. Cardelli, A theory of primitive objects. To appear.Google Scholar
  3. [Abadi, Cardelli 1994c]
    M. Abadi and L. Cardelli. A theory of primitive objects: untyped and first-order systems. Proc. Theoretical Aspects of Computer Software. Springer-Verlag.Google Scholar
  4. [Böhm, Berarducci 1985]
    C. Böhm and A. Berarducci, Automatic synthesis of typed λ-programs on term algebras. Theoretical Computer Science 39, 135–154.Google Scholar
  5. [Bruce 1993]
    K. Bruce. A paradigmatic object-oriented programming language: design, static typing, and semantics. Technical Report No. CS-92-01, revised (to appear in the Journal of Functional Programming). Williams College.Google Scholar
  6. [Cardelli 1991]
    L. Cardelli. Extensible records in a pure calculus of subtyping. Technical Report n.81. DEC Systems Research Center.Google Scholar
  7. [Cardelli, 1991]
    L. Cardelli, J.C. Mitchell, S. Martini, and A. Scedrov. An extension of system F with subtyping. Proc. Theoretical Aspects of Computer Software. Lecture Notes in Computer Science 526. Springer-Verlag.Google Scholar
  8. [Cardelli, Wegner 1985]
    L. Cardelli and P. Wegner, On understanding types, data abstraction and polymorphism. Computing Surveys 17(4), 471–522.Google Scholar
  9. [Curien, Ghelli 1992]
    P.-L. Curien and G. Ghelli, Coherence of subsumption, minimum typing and type-checking in F≤. Mathematical Structures in Computer Science 2(1), 55–91.Google Scholar
  10. [Girard, Lafont, Taylor 1989]
    J.-Y. Girard, Y. Lafont, and P. Taylor, Proofs and types. Cambridge University Press.Google Scholar
  11. [MacQueen, Plotkin, Sethi 1986]
    D.B. MacQueen, G.D. Plotkin, and R. Sethi, An ideal model for recursive polymorphic types. Information and Control 71, 95–130.Google Scholar
  12. [Meyer 1988]
    B. Meyer, Object-oriented software construction. Prentice Hall.Google Scholar
  13. [Mitchell, Honsell, Fisher 1993]
    J.C. Mitchell, F. Honsell, and K. Fisher. A lambda calculus of objects and method specialization. Proc. 8th Annual IEEE Symposium on Logic in Computer Science.Google Scholar
  14. [Wadsworth 1980]
    C. Wadsworth, Some unusual λ-calculus numeral systems. In To H.B. Curry: Essays on combinatory logic, lambda calculus and formalism, J.P. Seldin and J.R. Hindley, ed. Academic Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Martín Abadi
    • 1
  • Luca Cardelli
    • 1
  1. 1.Digital Equipment CorporationSystems Research CenterUSA

Personalised recommendations