Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example, they may be other programs, types or type constructors, class hierarchies, or even programming paradigms.
Generic programming techniques have always been of interest, both to practitioners and to theoreticians, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities.
Generic Programming comprises the edited proceedings of the Working Conference on Generic Programming, which was sponsored by the International Federation for Information Processing (IFIP) and held in Dagstuhl, Germany in July 2002. With contributions from leading researchers around the world, this volume captures the state of the art in this important emerging area.
Preface. Acknowledgements. Generic Programming within Dependently Typed Programming; T. Altenkirch, C. McBride. Generic Haskell, Specifically; D. Clarke, A. Löh. Generic Accumulations; A. Pardo. A Generic Algorithm for Minimum Chain Partitioning; S.A. Curtis. Concrete Generic Functionals; R.T. Boute. Discussion: The Role of Types in Generic Programming. Making the Usage of STL Safe; D. Gregor, S. Schupp. Static Data Structures; M. Burton, W. Griswold, A. McCulloch, G. Huber. Adaptive Extensions of Object-Oriented Systems; O. Seng, T. Genssler, B. Schulz. Complete Traversals as General Iteration Patterns; W. Klostermeyer, D. Musser, A. Sánchez-Ruíz. Efficient Implementation of Run-time Generic Types for Java; E. Allen, R. Cartwright, B. Stoler. Discussion: Views of Genericity.
Generic Programming within Dependently Typed Programming.- Generic Haskell, Specifically.- Generic Accumulations.- A Generic Algorithm for Minimum Chain Partitioning.- Concrete Generic Functionals.- Discussion: The Rôle of Types in Generic Programming.- Making the Usage of STL Safe.- Static Data Structures.- Adaptive Extensions of Object-Oriented Systems.- Complete Traversals as General Iteration Patterns.- Efficient Implementation of Run-time Generic Types for Java.- Discussion: Views of Genericity.
Inhaltsverzeichnis
Generic Programming within Dependently Typed Programming.- Generic Haskell, Specifically.- Generic Accumulations.- A Generic Algorithm for Minimum Chain Partitioning.- Concrete Generic Functionals.- Discussion: The Rôle of Types in Generic Programming.- Making the Usage of STL Safe.- Static Data Structures.- Adaptive Extensions of Object-Oriented Systems.- Complete Traversals as General Iteration Patterns.- Efficient Implementation of Run-time Generic Types for Java.- Discussion: Views of Genericity.
Klappentext
Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example, they may be other programs, types or type constructors, class hierarchies, or even programming paradigms.
Generic programming techniques have always been of interest, both to practitioners and to theoreticians, but only recently have generic programming techniques become a specific focus of research in the functional and object-oriented programming language communities.
Generic Programming comprises the edited proceedings of the Working Conference on Generic Programming, which was sponsored by the International Federation for Information Processing (IFIP) and held in Dagstuhl, Germany in July 2002. With contributions from leading researchers around the world, this volume captures the state of the art in this important emerging area.
