ComputingComputer ScienceAlgorithmsCompilersProgramming LanguagesAbstract Syntax TreesData-flow AnalysisGeneric ProgrammingObject-oriented ProgrammingRecursion TheoryType SystemsGeneric AlgorithmsGeneric FunctionsGeneric TypesPolymorphic Type SystemsPolymorphic TypesTemplate-based Design
this document for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. 1 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Structure of the library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3 Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4 Core components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
4
David R. Musser, Alexander A. Stepanov · Lecture notes in computer science · 1989 · 141 citations
Algorithm‐oriented generic libraries
David R. Musser, Alexander A. Stepanov · Software Practice and Experience · 1994 · 102 citations
Operators and algebraic structures
Deepak Kapur, David R. Musser, Alexander A. Stepanov · 1981 · 30 citations · Full text
A library of generic algorithms in Ada
David R. Musser, Alexander A. Stepanov · 1987 · 27 citations