The algorithmic problem solving group conducts research into mathematical method, in particular the problem-solving skills involved in the formulation and solution of algorithmic problems. Our goal is to articulate these skills primarily by way of concrete examples, but also by the development of appropriate mathematical theory.
Written by Joao Ferreira.
30th August 2009, from 9.00am to 5.30pm
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, and for at least 20 years generic programming techniques have been a specific focus of research in the functional and object-oriented programming language communities. Generic programming has gradually spread to more and more mainstream languages and is today widely used also in industry. This workshop will bring together leading researchers and practitioners in generic programming from around the world, and feature papers capturing the state of the art in this important area.
Link to the workshop.