Skip to main content
Springer Nature Link
Log in

Subtyping inheritance in languages for symbolic computation systems

  • Conference paper
  • First Online:
Design and Implementation of Symbolic Computation Systems (DISCO 1993)

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

  • 222 Accesses

Abstract

Object-oriented programming techniques can be fruitfully applied to design languages for symbolic computation systems. Unfortunately, basic correctness problems still exist in object-oriented languages, due to the interaction between polymorphism and method redefinition. Here a mechanism of subtyping inheritance is presented, in order to propose a solution of these problems. A subtyping inheritance mechanism (Enhanced Strict Inheritance) is defined by deriving from the characteristics of a presented model of subtyping. As the base of the subtyping rule, the monotonic (or covariant) rule is chosen. Once it is supported by the programming language of a symbolic computation system, our mechanism allows for a safe treatment of polymorphism induced by inheritance.

This work has been partially supported by Progetto Finalizzato “Sistemi Informatici e Calcolo Parallelo” of CNR under grant n. 92.01604.69.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.K. Abdali, G.W. Cherry, N. Soiffer, An Object Oriented Approach to Algebra System Design, in B.W. Char (Ed.) Proc. of ACM SYMSAC '86, 1986.

    Google Scholar 

  2. R. Agrawal, L.G. DeMichiel, B.G. Lindsay, Static Type Checking of Multi-Methods, in Proc. of OOPSLA'91, 1991.

    Google Scholar 

  3. G. Baumgartner, R. Stansifer, A Proposal to Study Type Systems for Computer Algebra, RISC-Linz Tech. Report 90-07.0, Mar. 1990.

    Google Scholar 

  4. L. Cardelli, A Semantics of Multiple Inheritance, in Proc. of Symp. on Semantics of Data Type, LNCS 173, Springer Verlag 1984.

    Google Scholar 

  5. L. Cardelli, P. Wegner, On Understanding types, Data Abstraction and Polymorphism, ACM Computing Surveys, Vol 17, 4, 1985.

    Article  Google Scholar 

  6. B.W. Char, K.O. Geddes, G.H. Gonnet, B.C. Leong, M.B. Monagan, S.M. Watt, Maple V Language Reference Manual, Springer Verlag, 1991.

    Google Scholar 

  7. I. Choi, M. Mannino, V. Tseng, Graph Interpretation of Methods: a Unifying Framework for Polymorphism in Object-Oriented Programming, OOPS Messenger, Vol 1, 2, 1992.

    Google Scholar 

  8. S. Danforth, C. Tomlinson, Type Theories and Object-Oriented Programming, ACM Computing Surveys, Vol 20, 1, 1988.

    Article  Google Scholar 

  9. A.C. Hearn, Reduce-3 User's Manual, Rand Corporation, S. Monica, California, USA, 1987.

    Google Scholar 

  10. G. Ghelli, A Static Type System for Message Passing, in Proc. of OOPSLA'91, 1991.

    Google Scholar 

  11. R.D. Jenks, R.S. Sutor, Axiom, the scientific computation, Springer Verlag, New York, 1992.

    Google Scholar 

  12. C. Limongelli, A. Miola, M. Temperini, Design and Implementation of Symbolic Computation Systems, in P.W. Gaffney, E.N. Houstis (Eds) Proc. IFIP TC2/WG2.5 Working Conference on Programming Environments for High Level Scientific Problem Solving, Elsevier Scientific Publisher, 1991.

    Google Scholar 

  13. C. Limongelli, M. Temperini, Abstract Specification of Structures and Methods in Symbolic Mathematical Computation, Theoretical Computer Science, 104, 1992.

    Google Scholar 

  14. M. Regio, M. Temperini, Type Redefinition and Polymorphism in Object Oriented Languages, in Proc. TOOLS PACIFIC, 1990.

    Google Scholar 

  15. B. Buchberger, G.E. Collins, M.J. Encarnacion, H. Hong, J.R. Johnson, W. Krandick, R. Loos, A.M. Mandache, A. Neubacher, H. Vielhaber, SACLIB User's Guide, RISC-Linz Tech. Report, 1992.

    Google Scholar 

  16. M. Temperini, Design and Implementation Methodologies for Symbolic Computation Systems, Ext. Abs. of Ph.d. Thesis, University “La Sapienza”, Roma, Italy, 1992.

    Google Scholar 

  17. P. Wang, R. Pavelle, MACSYMA from F to G, J. of Symbolic Computation, 1, 1, 1985.

    Google Scholar 

  18. S. Wolfram, Mathematica, A System for Doing Mathematics by Computer, second edition, Addison Wesley, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento Informatica e Sistemistica, Università “La Sapienza, Via Salaria 113, I-00198, Roma, Italy

    Paolo Di Blasio & Marco Temperini

Authors
  1. Paolo Di Blasio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Temperini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Miola

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Di Blasio, P., Temperini, M. (1993). Subtyping inheritance in languages for symbolic computation systems. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1993. Lecture Notes in Computer Science, vol 722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013172

Download citation

  • DOI: https://doi.org/10.1007/BFb0013172

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57235-0

  • Online ISBN: 978-3-540-47985-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics