Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1999: Fundamentals of Computation Theory pp 148–160Cite as

An interpretation of extensible objects

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1684))

Abstract

We provide a translation of Fisher-Honsell-Mitchell’s delegation-based object calculus with subtyping into a λ-calculus with extensible records.The target type system is an extension of the system \( \mathcal{F}^\omega \) of types depending on types with recursion,extensible records and a form of bounded universal quantification.We show that our translation is computationally adequate,that the typing rules of Fisher-Honsell-Mitchell’s calculus can be derived in a rather simple and natural way,and that our system enjoys the standard subject reduction property.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi, Baby Modula-3 and a theory of objects, J. of Functional Programming Vol 4, No 2 (1994) 249–283.

    MATH  Google Scholar 

  2. M. Abadi, L. Cardelli, A theory of primitive objects: untyped and first-order systems, TACS’ 94, Lecture Notes in Comput. Sci. 789 (1994) 296–320.

    Google Scholar 

  3. M. Abadi, L. Cardelli, R. Viswanathan, An interpretation of objects and object types, POPL’ 96 (1996) 396–409.

    Google Scholar 

  4. V. Bono, L. Liquori, A subtyping for the Fisher-Honsell-Mitchell lambda calculus of objects, CSL’ 94, Lecture Notes in Comput. Sci. 933 (1994) 16–30.

    Google Scholar 

  5. V. Bono, M. Bugliesi, Matching constraints for the lambda calculus of objects, TLCA’ 97, Lecture Notes in Comput. Sci. 1210 (1997) 46–63.

    Google Scholar 

  6. K. Bruce, The equivalence of two semantic definitions for inheritance in object-oriented languages, MFPS’ 92, Lecture Notes in Comput. Sci. 598 (1992) 102–124.

    Google Scholar 

  7. K. Bruce, L. Cardelli, B. Pierce, Comparing object encodings, TACS’ 97, Lecture Notes in Comput. Sci. 1281 (1997) 415–438.

    Google Scholar 

  8. K. Bruce, L. Petersen, A. Fiech, Subtyping is not a good “match” for object-oriented languages, ECOOP’ 97, Lecture Notes in Comput. Sci. 1241 (1997) 104–127.

    Google Scholar 

  9. L. Cardelli, A semantics of multiple inheritance, Semantics of Data Types, Lecture Notes in Comput. Sci. 173 (1984) 51–67. Also published in Information and Computation, Vol 76 (1988).

    Google Scholar 

  10. L. Cardelli, P. Wegner, On understanding types, data abstraction, and polymorphism, Computing Surveys 17 (1985) 471–522.

    Article  Google Scholar 

  11. A. Compagnoni, Subject reduction and minimal types for higher order subtyping, Tech. Rep. ECS-LFCS-97-363, University of Edinburgh (1997).

    Google Scholar 

  12. W. Cook, W. Hill, P. Canning, Inheritance is not subtyping, POPL’ 90 (1990) 125–135.

    Google Scholar 

  13. K. Fisher, F. Honsell, J. Mitchell, A lambda calculus of objects and method specialization, LICS’ 93 (1993) 26–38.

    Google Scholar 

  14. K. Fisher, J. Mitchell, Notes on typed object-oriented programming, TACS’ 94, Lecture Notes in Comput. Sci. 789 (1994) 844–885.

    Google Scholar 

  15. K. Fisher, J. Mitchell, A delegation-based object calculus with subtyping, FCT’ 95, Lecture Notes in Comput. Sci. 965 (1995) 42–61.

    Google Scholar 

  16. K. Fisher, Types Systems for Object-Oriented Programming Languages, PhD Thesis, Stanford University (1996).

    Google Scholar 

  17. P. Di Gianantonio, F. Honsell, L. Liquori, A lambda-calculus of objects with self-inficted extension, OOPSLA’ 98, ACM SIGPLAN Notices Vol 33, No 10 (1998) 166–178.

    Article  Google Scholar 

  18. J.-Y. Girard, Interprétation fonctionnelle et élimination des coupures dans l’arithmétique d’ordre supérieur, Thèse d’Ètat, Université Paris 7 (1972).

    Google Scholar 

  19. M. Hofmann, B. Pierce, A unifying type-theoretic framework for objects, J. of Functional Programming Vol. 5, No 4 (1995) 593–635.

    Article  MathSciNet  Google Scholar 

  20. J. Mitchell, Toward a typed foundation for method specialization and inheritance, POPL’ 90 (1990) 109–124.

    Google Scholar 

  21. R. Viswanathan, Full abstraction for first-order objects with recursive types and subtyping, LICS’ 98 (1998).

    Google Scholar 

  22. M. Wand, Complete type inference for simple objects, LICS’ 87 (1987) 37–44.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA Sophia Antipolis, BP 93-06902, Sophia Antipolis Cedex, France

    Gérard Boudol & Silvano Dal-Zilio

Authors
  1. Gérard Boudol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvano Dal-Zilio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boudol, G., Dal-Zilio, S. (1999). An interpretation of extensible objects. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation