Skip to main content
SpringerLink
Log in

A Systematic Catalogue of Reusable Abstract Data Types

  • Book
  • © 1990

Overview

Authors:
  1. Jürgen Uhl
    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. Hans Albrecht Schmid
    View author publications

    You can also search for this author in PubMed   Google Scholar

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

  • 1054 Accesses

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

Access this book

Log in via an institution
Softcover Book USD 54.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

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-4

  3. Motivation and objectives

    Pages 5-13

  4. How to reuse abstract data types

    Pages 15-36

  5. Structure of the catalogue

    Pages 37-44

  6. Structure of the building blocks

    Pages 45-109

  7. The building blocks

    Pages 111-198

  8. Technical issues

    Pages 199-208

  9. Case study: A file compression system

    Pages 209-225

  10. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

This book presents a comprehensive catalogue of elementary data types like sets, maps, orders, trees and lists, written in Ada. Such data types are often used in systems programming. The major focus is on: - a uniform syntactic and semantic interface for all data types, - many implementation variants per data type, all ac cessible through a single interface, - a hierarchical system of the data types as a basis for data type selection and implementation. Meeting these goals is the main achievement of the book. The combination of efficient applicability and ease of learning and maintenance is achieved by the carefully elaborated interfaces of the catalogue's data types. These interfaces combine abstraction, which is necessary for easy learning and for leaving implementation freedom, and functional completeness, which is an essential prerequisite for high performance in different application contexts. The selection of the right data type implementation for a given context is supported by the data type hierarchy which imposes different abstraction levels, and an orthogonal scheme of implementation variants which can be freely combined. Together with the uniformity of interfaces, the hierarchical composition of the catalogue leads to a small code base, from which different implementation variants are generated using a macro processor.

Bibliographic Information

  • Book Title: A Systematic Catalogue of Reusable Abstract Data Types

  • Authors: Jürgen Uhl, Hans Albrecht Schmid

  • Series Title: Lecture Notes in Computer Science

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1990

  • Softcover ISBN: 978-3-540-53229-3Published: 24 October 1990

  • eBook ISBN: 978-3-540-46777-9Published: 13 November 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XIV, 344

  • Topics: Software Engineering, Programming Languages, Compilers, Interpreters

Publish with us

Policies and ethics

Back to top

Search

Navigation