Concept-Based Component Libraries and Optimizing Compilers

This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible 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 examples.

• Type: Conference
• Year: 2002
• Where: IPPS
• Authors: Sibylle Schupp, D. P. Gregor, B. Osman, David R. Musser, Jeremy G. Siek, Lie-Quan Lee, Andrew Lumsdaine
• Keywords: Algorithm Concept Lattices, Component Library Development, Concept Lattices, Distributed And Parallel Computing, IPPS 2002