Skip to main content

Part of the book series: Macmillan Computer Science Series ((COMPSS))

  • 23 Accesses

Abstract

In Chapter 11 we discussed the advantages of implementing object classes using opaque abstract data types. One of the advantages was the reusability of code. A useful feature in a language would be to introduce a higher hierarchical concept than the modules and procedures we have seen so far in Modula-2, where the same code for say, a QUEUE, can be used to implement queues of REAL values, INTEGER values, CHAR values or some other ADT values. Similarly, in sorting REAL values, INTEGER values, CHAR values or some other ADT values it would be nice to write the sort code only once.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1989 Jill A. Hewitt and Raymond J. Frank

About this chapter

Cite this chapter

Hewitt, J.A., Frank, R.J. (1989). Generic Types. In: Software Engineering in Modula-2. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-11260-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-1-349-11260-9_14

  • Publisher Name: Palgrave, London

  • Print ISBN: 978-0-333-51518-1

  • Online ISBN: 978-1-349-11260-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics