Concept-Based Component Libraries and Optimizing Compilers

Authors:
Sibylle Schupp;D. P. Gregor;B. Osman;David R. Musser;Jeremy G. Siek;Lie-Quan Lee;Andrew Lumsdaine
Affiliations:
-;-;-;-;-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 10
Cited 0

Algorithm-oriented generic libraries

Software—Practice & Experience
Generic programming and the STL: using and extending the C++ Standard Template Library

Generic programming and the STL: using and extending the C++ Standard Template Library
A library of generic algorithms in Ada

SIGAda '87 Proceedings of the 1987 annual ACM SIGAda international conference on Ada
The generic graph component library

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The boost graph library: user guide and reference manual

The boost graph library: user guide and reference manual
The Art of Computer Programming Volumes 1-3 Boxed Set

The Art of Computer Programming Volumes 1-3 Boxed Set
Generic Programming

ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Array Design and Expression Evaluation in POOMA II

ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
The Matrix Template Library: A Generic Programming Approach to High Performance Numerical Linear Algebra

ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
User-Extensible SimplificationType-Based Optimizer Generators

CC '01 Proceedings of the 10th International Conference on Compiler Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based user-extensible simplification (type-based optimizer generators) and library transformations is first reviewed, then a new application--categorization of algorithms via precise descriptions of their performance characteristics--is outlined, with Standard Template Library and Boost Graph Library algorithm concept lattices as example.