Invited Talks

Symbolic and Algebraic Computation

Volume 358 of the series Lecture Notes in Computer Science pp 13-25


Generic programming

  • David R. MusserAffiliated withComputer Science Department, Rensselaer Polytechnic Institute
  • , Alexander A. StepanovAffiliated withComputer Science Department, Polytechnic University

* Final gross prices may vary according to local VAT.

Get Access


Generic programming centers around the idea of abstracting from concrete, efficient algorithms to obtain generic algorithms that can be combined with different data representations to produce a wide variety of useful software. For example, a class of generic sorting algorithms can be defined which work with finite sequences but which can be instantiated in different ways to produce algorithms working on arrays or linked lists.

Four kinds of abstraction—data, algorithmic, structural, and representational—are discussed, with examples of their use in building an Ada library of software components. The main topic discussed is generic algorithms and an approach to their formal specification and verification, with illustration in terms of a partitioning algorithm such as is used in the quicksort algorithm. It is argued that generically programmed software component libraries offer important advantages for achieving software productivity and reliability.